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_spec0_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:31:22,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:31:22,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:31:22,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:31:22,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:31:22,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:31:22,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:31:22,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:31:22,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:31:22,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:31:22,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:31:22,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:31:22,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:31:22,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:31:22,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:31:22,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:31:22,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:31:22,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:31:22,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:31:22,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:31:22,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:31:22,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:31:22,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:31:22,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:31:22,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:31:22,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:31:22,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:31:22,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:31:22,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:31:22,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:31:22,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:31:22,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:31:22,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:31:22,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:31:22,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:31:22,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:31:22,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:31:22,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:31:22,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:31:22,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:31:22,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:31:22,421 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:31:22,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:31:22,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:31:22,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:31:22,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:31:22,437 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:31:22,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:31:22,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:31:22,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:31:22,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:31:22,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:31:22,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:31:22,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:31:22,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:31:22,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:31:22,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:31:22,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:31:22,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:31:22,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:31:22,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:31:22,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:31:22,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:31:22,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:31:22,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:31:22,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:31:22,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:31:22,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:31:22,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:31:22,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:31:22,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:31:22,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:31:22,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:31:22,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:31:22,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:31:22,494 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:31:22,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_productSimulator.cil.c [2019-09-08 04:31:22,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bb296b4/2197dc7f54684033a2ac2ca957afb9f4/FLAGc73a0d5ab [2019-09-08 04:31:23,217 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:31:23,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_productSimulator.cil.c [2019-09-08 04:31:23,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bb296b4/2197dc7f54684033a2ac2ca957afb9f4/FLAGc73a0d5ab [2019-09-08 04:31:23,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bb296b4/2197dc7f54684033a2ac2ca957afb9f4 [2019-09-08 04:31:23,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:31:23,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:31:23,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:31:23,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:31:23,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:31:23,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:31:23" (1/1) ... [2019-09-08 04:31:23,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fabccff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:23, skipping insertion in model container [2019-09-08 04:31:23,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:31:23" (1/1) ... [2019-09-08 04:31:23,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:31:23,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:31:24,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:31:24,308 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:31:24,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:31:24,673 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:31:24,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24 WrapperNode [2019-09-08 04:31:24,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:31:24,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:31:24,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:31:24,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:31:24,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (1/1) ... [2019-09-08 04:31:24,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:31:24,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:31:24,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:31:24,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:31:24,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (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:31:24,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:31:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:31:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:31:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:31:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:31:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:31:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:31:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:31:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-09-08 04:31:24,956 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-09-08 04:31:24,956 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-09-08 04:31:24,956 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-09-08 04:31:24,956 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-09-08 04:31:24,957 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-09-08 04:31:24,957 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:31:24,957 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:31:24,957 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-09-08 04:31:24,958 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-09-08 04:31:24,958 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-09-08 04:31:24,958 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-09-08 04:31:24,958 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-09-08 04:31:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-09-08 04:31:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-09-08 04:31:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-09-08 04:31:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:31:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:31:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:31:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:31:24,960 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:31:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:31:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:31:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:31:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:31:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:31:24,961 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:31:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:31:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:31:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:31:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:31:24,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:31:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:31:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:31:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:31:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:31:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:31:24,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:31:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:31:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:31:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:31:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:31:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:31:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:31:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:31:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:31:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:31:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:31:24,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:31:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:31:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:31:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:31:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:31:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:31:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:31:24,967 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:31:24,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:31:24,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:31:24,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:31:24,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:31:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:31:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:31:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:31:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:31:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:31:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:31:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:31:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:31:25,018 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:31:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:31:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:31:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:31:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:31:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:31:25,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:31:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:31:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:31:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:31:25,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:31:25,021 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:31:25,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:31:25,021 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:31:25,021 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-09-08 04:31:25,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-09-08 04:31:25,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:31:25,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-09-08 04:31:25,022 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-09-08 04:31:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:31:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-09-08 04:31:25,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-09-08 04:31:25,024 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:31:25,024 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:31:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:31:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:31:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:31:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:31:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:31:25,026 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:31:25,026 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:31:25,026 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:31:25,026 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:31:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:31:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:31:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:31:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:31:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:31:25,028 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:31:25,028 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:31:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:31:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-09-08 04:31:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-09-08 04:31:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-09-08 04:31:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-09-08 04:31:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-09-08 04:31:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-09-08 04:31:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:31:25,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-09-08 04:31:25,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-09-08 04:31:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:31:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:31:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:31:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:31:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:31:25,034 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:31:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:31:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:31:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:31:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:31:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:31:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:31:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:31:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:31:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:31:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:31:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:31:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:31:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:31:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:31:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:31:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:31:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:31:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:31:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:31:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:31:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:31:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:31:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:31:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:31:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:31:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:31:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:31:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:31:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:31:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:31:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:31:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:31:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:31:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:31:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:31:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:31:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:31:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:31:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:31:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:31:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:31:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:31:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:31:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:31:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:31:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:31:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:31:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:31:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:31:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:31:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:31:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:31:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:31:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:31:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-09-08 04:31:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-09-08 04:31:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-09-08 04:31:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-09-08 04:31:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-09-08 04:31:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-09-08 04:31:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-09-08 04:31:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-09-08 04:31:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-09-08 04:31:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-09-08 04:31:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-09-08 04:31:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-09-08 04:31:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-09-08 04:31:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-09-08 04:31:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:31:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:31:25,062 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:31:25,062 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:31:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:31:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:31:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:31:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:31:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:31:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:31:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:31:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:31:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:31:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:31:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:31:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:31:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:31:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:31:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:31:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:31:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:31:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:31:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:31:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:31:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:31:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:31:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:31:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:31:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:31:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:31:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:31:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:31:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:31:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:31:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:31:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:31:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:31:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:31:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:31:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:31:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:31:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:31:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:31:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:31:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:31:25,073 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-09-08 04:31:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-09-08 04:31:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-09-08 04:31:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-09-08 04:31:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-09-08 04:31:25,074 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-09-08 04:31:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:31:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-09-08 04:31:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-09-08 04:31:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-09-08 04:31:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-09-08 04:31:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-09-08 04:31:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-09-08 04:31:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-09-08 04:31:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-09-08 04:31:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:31:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:31:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:31:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:31:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:31:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:31:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:31:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:31:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:31:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:31:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:31:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:31:27,441 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:31:27,442 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:31:27,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:31:27 BoogieIcfgContainer [2019-09-08 04:31:27,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:31:27,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:31:27,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:31:27,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:31:27,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:31:23" (1/3) ... [2019-09-08 04:31:27,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac8be63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:31:27, skipping insertion in model container [2019-09-08 04:31:27,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:31:24" (2/3) ... [2019-09-08 04:31:27,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac8be63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:31:27, skipping insertion in model container [2019-09-08 04:31:27,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:31:27" (3/3) ... [2019-09-08 04:31:27,456 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_productSimulator.cil.c [2019-09-08 04:31:27,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:31:27,480 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:31:27,499 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:31:27,552 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:31:27,553 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:31:27,553 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:31:27,553 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:31:27,554 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:31:27,554 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:31:27,554 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:31:27,554 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:31:27,554 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:31:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states. [2019-09-08 04:31:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 04:31:27,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:27,653 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:27,658 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1166510359, now seen corresponding path program 1 times [2019-09-08 04:31:27,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:27,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:27,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:27,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:28,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:31:28,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:31:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:31:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:31:28,480 INFO L87 Difference]: Start difference. First operand 811 states. Second operand 6 states. [2019-09-08 04:31:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:28,709 INFO L93 Difference]: Finished difference Result 1540 states and 2136 transitions. [2019-09-08 04:31:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:31:28,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-08 04:31:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:28,740 INFO L225 Difference]: With dead ends: 1540 [2019-09-08 04:31:28,741 INFO L226 Difference]: Without dead ends: 782 [2019-09-08 04:31:28,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:31:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-09-08 04:31:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-09-08 04:31:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-09-08 04:31:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1064 transitions. [2019-09-08 04:31:28,868 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1064 transitions. Word has length 225 [2019-09-08 04:31:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:28,871 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1064 transitions. [2019-09-08 04:31:28,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:31:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1064 transitions. [2019-09-08 04:31:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 04:31:28,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:28,880 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:28,881 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -698788770, now seen corresponding path program 1 times [2019-09-08 04:31:28,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:28,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:28,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:28,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:29,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:29,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:29,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:29,348 INFO L87 Difference]: Start difference. First operand 782 states and 1064 transitions. Second operand 3 states. [2019-09-08 04:31:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:29,406 INFO L93 Difference]: Finished difference Result 1217 states and 1629 transitions. [2019-09-08 04:31:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:29,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-09-08 04:31:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:29,422 INFO L225 Difference]: With dead ends: 1217 [2019-09-08 04:31:29,422 INFO L226 Difference]: Without dead ends: 785 [2019-09-08 04:31:29,425 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:31:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-09-08 04:31:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 784. [2019-09-08 04:31:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-09-08 04:31:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1066 transitions. [2019-09-08 04:31:29,490 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1066 transitions. Word has length 231 [2019-09-08 04:31:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:29,492 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1066 transitions. [2019-09-08 04:31:29,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1066 transitions. [2019-09-08 04:31:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 04:31:29,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:29,502 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:29,502 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash 343321335, now seen corresponding path program 1 times [2019-09-08 04:31:29,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:31:30,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:30,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:31:30,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:31:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:31:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:31:30,008 INFO L87 Difference]: Start difference. First operand 784 states and 1066 transitions. Second operand 6 states. [2019-09-08 04:31:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:31,076 INFO L93 Difference]: Finished difference Result 1880 states and 2567 transitions. [2019-09-08 04:31:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:31:31,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-08 04:31:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:31,091 INFO L225 Difference]: With dead ends: 1880 [2019-09-08 04:31:31,092 INFO L226 Difference]: Without dead ends: 1461 [2019-09-08 04:31:31,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:31:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-09-08 04:31:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1452. [2019-09-08 04:31:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-09-08 04:31:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1992 transitions. [2019-09-08 04:31:31,178 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1992 transitions. Word has length 238 [2019-09-08 04:31:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:31,179 INFO L475 AbstractCegarLoop]: Abstraction has 1452 states and 1992 transitions. [2019-09-08 04:31:31,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:31:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1992 transitions. [2019-09-08 04:31:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 04:31:31,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:31,187 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:31,187 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1265830378, now seen corresponding path program 1 times [2019-09-08 04:31:31,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:31,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:31,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:31:31,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:31,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:31:31,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:31:31,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:31:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:31:31,527 INFO L87 Difference]: Start difference. First operand 1452 states and 1992 transitions. Second operand 6 states. [2019-09-08 04:31:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:32,434 INFO L93 Difference]: Finished difference Result 3650 states and 5004 transitions. [2019-09-08 04:31:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:31:32,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-08 04:31:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:32,453 INFO L225 Difference]: With dead ends: 3650 [2019-09-08 04:31:32,454 INFO L226 Difference]: Without dead ends: 2811 [2019-09-08 04:31:32,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:31:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2019-09-08 04:31:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2788. [2019-09-08 04:31:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2019-09-08 04:31:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3846 transitions. [2019-09-08 04:31:32,611 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3846 transitions. Word has length 239 [2019-09-08 04:31:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:32,612 INFO L475 AbstractCegarLoop]: Abstraction has 2788 states and 3846 transitions. [2019-09-08 04:31:32,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:31:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3846 transitions. [2019-09-08 04:31:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 04:31:32,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:32,625 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:32,626 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:32,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1889171365, now seen corresponding path program 1 times [2019-09-08 04:31:32,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:32,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:32,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:32,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:32,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:31:32,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:32,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:31:32,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:31:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:31:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:31:32,942 INFO L87 Difference]: Start difference. First operand 2788 states and 3846 transitions. Second operand 6 states. [2019-09-08 04:31:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:33,990 INFO L93 Difference]: Finished difference Result 7106 states and 9776 transitions. [2019-09-08 04:31:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:31:33,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 04:31:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:34,030 INFO L225 Difference]: With dead ends: 7106 [2019-09-08 04:31:34,031 INFO L226 Difference]: Without dead ends: 5066 [2019-09-08 04:31:34,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:31:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2019-09-08 04:31:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 5025. [2019-09-08 04:31:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-08 04:31:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 6990 transitions. [2019-09-08 04:31:34,355 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 6990 transitions. Word has length 240 [2019-09-08 04:31:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:34,357 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 6990 transitions. [2019-09-08 04:31:34,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:31:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 6990 transitions. [2019-09-08 04:31:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 04:31:34,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:34,378 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,379 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash 852775003, now seen corresponding path program 1 times [2019-09-08 04:31:34,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:34,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:34,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:34,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:34,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:34,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:34,574 INFO L87 Difference]: Start difference. First operand 5025 states and 6990 transitions. Second operand 3 states. [2019-09-08 04:31:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:34,727 INFO L93 Difference]: Finished difference Result 10374 states and 14622 transitions. [2019-09-08 04:31:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:34,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-08 04:31:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:34,762 INFO L225 Difference]: With dead ends: 10374 [2019-09-08 04:31:34,762 INFO L226 Difference]: Without dead ends: 5464 [2019-09-08 04:31:34,781 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:31:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-09-08 04:31:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5457. [2019-09-08 04:31:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-09-08 04:31:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7759 transitions. [2019-09-08 04:31:35,019 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7759 transitions. Word has length 251 [2019-09-08 04:31:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:35,020 INFO L475 AbstractCegarLoop]: Abstraction has 5457 states and 7759 transitions. [2019-09-08 04:31:35,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7759 transitions. [2019-09-08 04:31:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 04:31:35,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:35,041 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,041 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:35,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1905759325, now seen corresponding path program 1 times [2019-09-08 04:31:35,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:35,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:35,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:35,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:35,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:35,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:35,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:35,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:35,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:35,289 INFO L87 Difference]: Start difference. First operand 5457 states and 7759 transitions. Second operand 3 states. [2019-09-08 04:31:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:35,457 INFO L93 Difference]: Finished difference Result 11638 states and 16873 transitions. [2019-09-08 04:31:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:35,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 04:31:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:35,505 INFO L225 Difference]: With dead ends: 11638 [2019-09-08 04:31:35,505 INFO L226 Difference]: Without dead ends: 6296 [2019-09-08 04:31:35,526 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:31:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-09-08 04:31:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 6289. [2019-09-08 04:31:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6289 states. [2019-09-08 04:31:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 9233 transitions. [2019-09-08 04:31:35,796 INFO L78 Accepts]: Start accepts. Automaton has 6289 states and 9233 transitions. Word has length 252 [2019-09-08 04:31:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:35,797 INFO L475 AbstractCegarLoop]: Abstraction has 6289 states and 9233 transitions. [2019-09-08 04:31:35,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6289 states and 9233 transitions. [2019-09-08 04:31:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 04:31:35,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:35,822 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,822 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:35,823 INFO L82 PathProgramCache]: Analyzing trace with hash 52663873, now seen corresponding path program 1 times [2019-09-08 04:31:35,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:35,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:35,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:35,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:35,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:35,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:35,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:35,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:35,969 INFO L87 Difference]: Start difference. First operand 6289 states and 9233 transitions. Second operand 3 states. [2019-09-08 04:31:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:36,179 INFO L93 Difference]: Finished difference Result 14070 states and 21183 transitions. [2019-09-08 04:31:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:36,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 04:31:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:36,227 INFO L225 Difference]: With dead ends: 14070 [2019-09-08 04:31:36,228 INFO L226 Difference]: Without dead ends: 7896 [2019-09-08 04:31:36,251 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:31:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2019-09-08 04:31:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 7889. [2019-09-08 04:31:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7889 states. [2019-09-08 04:31:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7889 states to 7889 states and 12053 transitions. [2019-09-08 04:31:36,681 INFO L78 Accepts]: Start accepts. Automaton has 7889 states and 12053 transitions. Word has length 253 [2019-09-08 04:31:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:36,682 INFO L475 AbstractCegarLoop]: Abstraction has 7889 states and 12053 transitions. [2019-09-08 04:31:36,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7889 states and 12053 transitions. [2019-09-08 04:31:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 04:31:36,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:36,724 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:36,724 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash -700469827, now seen corresponding path program 1 times [2019-09-08 04:31:36,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:36,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:36,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:36,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:36,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:36,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:36,905 INFO L87 Difference]: Start difference. First operand 7889 states and 12053 transitions. Second operand 3 states. [2019-09-08 04:31:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:37,201 INFO L93 Difference]: Finished difference Result 18742 states and 29419 transitions. [2019-09-08 04:31:37,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:37,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 04:31:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:37,253 INFO L225 Difference]: With dead ends: 18742 [2019-09-08 04:31:37,254 INFO L226 Difference]: Without dead ends: 10968 [2019-09-08 04:31:37,282 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:31:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10968 states. [2019-09-08 04:31:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10968 to 10961. [2019-09-08 04:31:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-09-08 04:31:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 17437 transitions. [2019-09-08 04:31:37,913 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 17437 transitions. Word has length 254 [2019-09-08 04:31:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:37,914 INFO L475 AbstractCegarLoop]: Abstraction has 10961 states and 17437 transitions. [2019-09-08 04:31:37,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 17437 transitions. [2019-09-08 04:31:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 04:31:37,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:37,967 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,968 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash -814717913, now seen corresponding path program 1 times [2019-09-08 04:31:37,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:37,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:37,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:31:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:38,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:38,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:38,134 INFO L87 Difference]: Start difference. First operand 10961 states and 17437 transitions. Second operand 3 states. [2019-09-08 04:31:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:38,550 INFO L93 Difference]: Finished difference Result 27702 states and 45123 transitions. [2019-09-08 04:31:38,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:38,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-08 04:31:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:38,646 INFO L225 Difference]: With dead ends: 27702 [2019-09-08 04:31:38,646 INFO L226 Difference]: Without dead ends: 16856 [2019-09-08 04:31:38,709 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:31:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16856 states. [2019-09-08 04:31:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16856 to 16849. [2019-09-08 04:31:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16849 states. [2019-09-08 04:31:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16849 states to 16849 states and 27693 transitions. [2019-09-08 04:31:40,286 INFO L78 Accepts]: Start accepts. Automaton has 16849 states and 27693 transitions. Word has length 255 [2019-09-08 04:31:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:40,286 INFO L475 AbstractCegarLoop]: Abstraction has 16849 states and 27693 transitions. [2019-09-08 04:31:40,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 16849 states and 27693 transitions. [2019-09-08 04:31:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 04:31:40,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:40,361 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,361 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:40,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash 826554327, now seen corresponding path program 1 times [2019-09-08 04:31:40,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:40,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:40,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:40,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:40,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:31:40,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:40,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:31:40,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:31:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:31:40,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:31:40,575 INFO L87 Difference]: Start difference. First operand 16849 states and 27693 transitions. Second operand 4 states. [2019-09-08 04:31:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:42,803 INFO L93 Difference]: Finished difference Result 50230 states and 83129 transitions. [2019-09-08 04:31:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:31:42,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-08 04:31:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:42,961 INFO L225 Difference]: With dead ends: 50230 [2019-09-08 04:31:42,962 INFO L226 Difference]: Without dead ends: 33418 [2019-09-08 04:31:43,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:31:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33418 states. [2019-09-08 04:31:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33418 to 33415. [2019-09-08 04:31:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33415 states. [2019-09-08 04:31:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33415 states to 33415 states and 54945 transitions. [2019-09-08 04:31:45,572 INFO L78 Accepts]: Start accepts. Automaton has 33415 states and 54945 transitions. Word has length 256 [2019-09-08 04:31:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:45,573 INFO L475 AbstractCegarLoop]: Abstraction has 33415 states and 54945 transitions. [2019-09-08 04:31:45,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:31:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33415 states and 54945 transitions. [2019-09-08 04:31:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 04:31:45,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:45,761 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:45,761 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:45,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960127, now seen corresponding path program 1 times [2019-09-08 04:31:45,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:45,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 04:31:46,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:46,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:31:46,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:31:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:31:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:31:46,027 INFO L87 Difference]: Start difference. First operand 33415 states and 54945 transitions. Second operand 11 states. [2019-09-08 04:31:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:46,749 INFO L93 Difference]: Finished difference Result 33418 states and 54947 transitions. [2019-09-08 04:31:46,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:31:46,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2019-09-08 04:31:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:46,824 INFO L225 Difference]: With dead ends: 33418 [2019-09-08 04:31:46,824 INFO L226 Difference]: Without dead ends: 16824 [2019-09-08 04:31:46,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:31:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16824 states. [2019-09-08 04:31:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16824 to 16824. [2019-09-08 04:31:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16824 states. [2019-09-08 04:31:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16824 states to 16824 states and 27623 transitions. [2019-09-08 04:31:47,872 INFO L78 Accepts]: Start accepts. Automaton has 16824 states and 27623 transitions. Word has length 249 [2019-09-08 04:31:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:47,873 INFO L475 AbstractCegarLoop]: Abstraction has 16824 states and 27623 transitions. [2019-09-08 04:31:47,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:31:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 16824 states and 27623 transitions. [2019-09-08 04:31:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 04:31:47,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:47,941 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:47,941 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash 225047104, now seen corresponding path program 1 times [2019-09-08 04:31:47,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:47,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 04:31:48,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:48,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:48,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:48,088 INFO L87 Difference]: Start difference. First operand 16824 states and 27623 transitions. Second operand 3 states. [2019-09-08 04:31:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:48,571 INFO L93 Difference]: Finished difference Result 33600 states and 55282 transitions. [2019-09-08 04:31:48,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:48,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-09-08 04:31:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:48,626 INFO L225 Difference]: With dead ends: 33600 [2019-09-08 04:31:48,627 INFO L226 Difference]: Without dead ends: 16817 [2019-09-08 04:31:48,670 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:31:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2019-09-08 04:31:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 16817. [2019-09-08 04:31:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16817 states. [2019-09-08 04:31:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 27601 transitions. [2019-09-08 04:31:49,284 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 27601 transitions. Word has length 274 [2019-09-08 04:31:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:49,285 INFO L475 AbstractCegarLoop]: Abstraction has 16817 states and 27601 transitions. [2019-09-08 04:31:49,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 27601 transitions. [2019-09-08 04:31:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 04:31:49,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:49,335 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:49,335 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1480022866, now seen corresponding path program 1 times [2019-09-08 04:31:49,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:49,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 04:31:49,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:49,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:31:49,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:31:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:31:49,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:31:49,794 INFO L87 Difference]: Start difference. First operand 16817 states and 27601 transitions. Second operand 4 states. [2019-09-08 04:31:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:50,913 INFO L93 Difference]: Finished difference Result 33568 states and 55122 transitions. [2019-09-08 04:31:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:31:50,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-09-08 04:31:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:50,972 INFO L225 Difference]: With dead ends: 33568 [2019-09-08 04:31:50,973 INFO L226 Difference]: Without dead ends: 16817 [2019-09-08 04:31:51,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:31:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2019-09-08 04:31:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 16817. [2019-09-08 04:31:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16817 states. [2019-09-08 04:31:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 26058 transitions. [2019-09-08 04:31:51,647 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 26058 transitions. Word has length 284 [2019-09-08 04:31:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:51,648 INFO L475 AbstractCegarLoop]: Abstraction has 16817 states and 26058 transitions. [2019-09-08 04:31:51,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:31:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 26058 transitions. [2019-09-08 04:31:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 04:31:51,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:51,691 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:31:51,692 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 523294158, now seen corresponding path program 1 times [2019-09-08 04:31:51,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:31:52,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 04:31:52,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 04:31:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 04:31:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:31:52,193 INFO L87 Difference]: Start difference. First operand 16817 states and 26058 transitions. Second operand 22 states. [2019-09-08 04:32:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:00,513 INFO L93 Difference]: Finished difference Result 43012 states and 66057 transitions. [2019-09-08 04:32:00,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 04:32:00,514 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 311 [2019-09-08 04:32:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:00,644 INFO L225 Difference]: With dead ends: 43012 [2019-09-08 04:32:00,645 INFO L226 Difference]: Without dead ends: 40108 [2019-09-08 04:32:00,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=3815, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 04:32:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40108 states. [2019-09-08 04:32:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40108 to 39903. [2019-09-08 04:32:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39903 states. [2019-09-08 04:32:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39903 states to 39903 states and 61692 transitions. [2019-09-08 04:32:02,529 INFO L78 Accepts]: Start accepts. Automaton has 39903 states and 61692 transitions. Word has length 311 [2019-09-08 04:32:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:02,530 INFO L475 AbstractCegarLoop]: Abstraction has 39903 states and 61692 transitions. [2019-09-08 04:32:02,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 04:32:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 39903 states and 61692 transitions. [2019-09-08 04:32:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 04:32:02,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:02,613 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:02,614 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2127710983, now seen corresponding path program 1 times [2019-09-08 04:32:02,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:02,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:02,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:02,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:02,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:32:02,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:32:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:32:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:32:02,948 INFO L87 Difference]: Start difference. First operand 39903 states and 61692 transitions. Second operand 15 states. [2019-09-08 04:32:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:04,142 INFO L93 Difference]: Finished difference Result 52882 states and 79332 transitions. [2019-09-08 04:32:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:32:04,142 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 312 [2019-09-08 04:32:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:04,257 INFO L225 Difference]: With dead ends: 52882 [2019-09-08 04:32:04,258 INFO L226 Difference]: Without dead ends: 40701 [2019-09-08 04:32:04,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-09-08 04:32:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40701 states. [2019-09-08 04:32:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40701 to 40701. [2019-09-08 04:32:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40701 states. [2019-09-08 04:32:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40701 states to 40701 states and 62868 transitions. [2019-09-08 04:32:05,954 INFO L78 Accepts]: Start accepts. Automaton has 40701 states and 62868 transitions. Word has length 312 [2019-09-08 04:32:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:05,955 INFO L475 AbstractCegarLoop]: Abstraction has 40701 states and 62868 transitions. [2019-09-08 04:32:05,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:32:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40701 states and 62868 transitions. [2019-09-08 04:32:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 04:32:06,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:06,038 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:06,038 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash -194327907, now seen corresponding path program 1 times [2019-09-08 04:32:06,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:06,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:06,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:06,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 04:32:06,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:32:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:32:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:32:06,408 INFO L87 Difference]: Start difference. First operand 40701 states and 62868 transitions. Second operand 17 states. [2019-09-08 04:32:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:12,916 INFO L93 Difference]: Finished difference Result 53955 states and 81361 transitions. [2019-09-08 04:32:12,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 04:32:12,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 312 [2019-09-08 04:32:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:13,032 INFO L225 Difference]: With dead ends: 53955 [2019-09-08 04:32:13,032 INFO L226 Difference]: Without dead ends: 41571 [2019-09-08 04:32:13,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:32:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41571 states. [2019-09-08 04:32:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41571 to 41366. [2019-09-08 04:32:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41366 states. [2019-09-08 04:32:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41366 states to 41366 states and 63918 transitions. [2019-09-08 04:32:15,978 INFO L78 Accepts]: Start accepts. Automaton has 41366 states and 63918 transitions. Word has length 312 [2019-09-08 04:32:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:15,979 INFO L475 AbstractCegarLoop]: Abstraction has 41366 states and 63918 transitions. [2019-09-08 04:32:15,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:32:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41366 states and 63918 transitions. [2019-09-08 04:32:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 04:32:16,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:16,063 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:16,063 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:16,063 INFO L82 PathProgramCache]: Analyzing trace with hash 45945560, now seen corresponding path program 1 times [2019-09-08 04:32:16,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:16,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 04:32:16,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:16,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 04:32:16,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 04:32:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 04:32:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:32:16,443 INFO L87 Difference]: Start difference. First operand 41366 states and 63918 transitions. Second operand 22 states. [2019-09-08 04:32:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:17,997 INFO L93 Difference]: Finished difference Result 55885 states and 84190 transitions. [2019-09-08 04:32:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 04:32:17,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 321 [2019-09-08 04:32:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:18,134 INFO L225 Difference]: With dead ends: 55885 [2019-09-08 04:32:18,134 INFO L226 Difference]: Without dead ends: 42675 [2019-09-08 04:32:18,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:32:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42675 states. [2019-09-08 04:32:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42675 to 42661. [2019-09-08 04:32:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42661 states. [2019-09-08 04:32:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42661 states to 42661 states and 65808 transitions. [2019-09-08 04:32:19,812 INFO L78 Accepts]: Start accepts. Automaton has 42661 states and 65808 transitions. Word has length 321 [2019-09-08 04:32:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:19,813 INFO L475 AbstractCegarLoop]: Abstraction has 42661 states and 65808 transitions. [2019-09-08 04:32:19,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 04:32:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 42661 states and 65808 transitions. [2019-09-08 04:32:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 04:32:19,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:19,908 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:19,908 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1670261878, now seen corresponding path program 1 times [2019-09-08 04:32:19,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:19,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:19,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:20,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:20,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 04:32:20,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:32:20,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:32:20,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:32:20,245 INFO L87 Difference]: Start difference. First operand 42661 states and 65808 transitions. Second operand 17 states. [2019-09-08 04:32:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:22,129 INFO L93 Difference]: Finished difference Result 56522 states and 84645 transitions. [2019-09-08 04:32:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:32:22,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 321 [2019-09-08 04:32:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:22,244 INFO L225 Difference]: With dead ends: 56522 [2019-09-08 04:32:22,244 INFO L226 Difference]: Without dead ends: 42675 [2019-09-08 04:32:22,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:32:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42675 states. [2019-09-08 04:32:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42675 to 42661. [2019-09-08 04:32:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42661 states. [2019-09-08 04:32:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42661 states to 42661 states and 65780 transitions. [2019-09-08 04:32:23,636 INFO L78 Accepts]: Start accepts. Automaton has 42661 states and 65780 transitions. Word has length 321 [2019-09-08 04:32:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:23,637 INFO L475 AbstractCegarLoop]: Abstraction has 42661 states and 65780 transitions. [2019-09-08 04:32:23,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:32:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42661 states and 65780 transitions. [2019-09-08 04:32:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 04:32:23,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:23,722 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:23,722 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:23,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1046583234, now seen corresponding path program 1 times [2019-09-08 04:32:23,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:23,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:23,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:23,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:24,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:32:24,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:32:24,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:32:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:32:24,007 INFO L87 Difference]: Start difference. First operand 42661 states and 65780 transitions. Second operand 7 states. [2019-09-08 04:32:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:28,854 INFO L93 Difference]: Finished difference Result 85014 states and 135003 transitions. [2019-09-08 04:32:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:32:28,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 321 [2019-09-08 04:32:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:29,250 INFO L225 Difference]: With dead ends: 85014 [2019-09-08 04:32:29,251 INFO L226 Difference]: Without dead ends: 71055 [2019-09-08 04:32:29,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 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:32:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71055 states. [2019-09-08 04:32:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71055 to 71049. [2019-09-08 04:32:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71049 states. [2019-09-08 04:32:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71049 states to 71049 states and 110394 transitions. [2019-09-08 04:32:33,778 INFO L78 Accepts]: Start accepts. Automaton has 71049 states and 110394 transitions. Word has length 321 [2019-09-08 04:32:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:33,778 INFO L475 AbstractCegarLoop]: Abstraction has 71049 states and 110394 transitions. [2019-09-08 04:32:33,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:32:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 71049 states and 110394 transitions. [2019-09-08 04:32:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-08 04:32:33,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:33,869 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:33,869 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2064946049, now seen corresponding path program 1 times [2019-09-08 04:32:33,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:33,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:33,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:34,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:34,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-09-08 04:32:34,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 04:32:34,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 04:32:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 04:32:34,635 INFO L87 Difference]: Start difference. First operand 71049 states and 110394 transitions. Second operand 38 states. [2019-09-08 04:32:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:38,313 INFO L93 Difference]: Finished difference Result 115761 states and 177035 transitions. [2019-09-08 04:32:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 04:32:38,314 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 313 [2019-09-08 04:32:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:38,713 INFO L225 Difference]: With dead ends: 115761 [2019-09-08 04:32:38,713 INFO L226 Difference]: Without dead ends: 76046 [2019-09-08 04:32:38,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:32:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76046 states. [2019-09-08 04:32:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76046 to 75989. [2019-09-08 04:32:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75989 states. [2019-09-08 04:32:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75989 states to 75989 states and 117804 transitions. [2019-09-08 04:32:44,594 INFO L78 Accepts]: Start accepts. Automaton has 75989 states and 117804 transitions. Word has length 313 [2019-09-08 04:32:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:44,595 INFO L475 AbstractCegarLoop]: Abstraction has 75989 states and 117804 transitions. [2019-09-08 04:32:44,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 04:32:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75989 states and 117804 transitions. [2019-09-08 04:32:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 04:32:44,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:44,701 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:44,701 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash -635295460, now seen corresponding path program 1 times [2019-09-08 04:32:44,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:44,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:44,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:32:44,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:32:44,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:32:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:32:44,962 INFO L87 Difference]: Start difference. First operand 75989 states and 117804 transitions. Second operand 13 states. [2019-09-08 04:32:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:46,798 INFO L93 Difference]: Finished difference Result 76580 states and 118646 transitions. [2019-09-08 04:32:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:32:46,799 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 317 [2019-09-08 04:32:46,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:47,102 INFO L225 Difference]: With dead ends: 76580 [2019-09-08 04:32:47,102 INFO L226 Difference]: Without dead ends: 76577 [2019-09-08 04:32:47,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:32:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76577 states. [2019-09-08 04:32:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76577 to 76577. [2019-09-08 04:32:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76577 states. [2019-09-08 04:32:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76577 states to 76577 states and 118532 transitions. [2019-09-08 04:32:52,713 INFO L78 Accepts]: Start accepts. Automaton has 76577 states and 118532 transitions. Word has length 317 [2019-09-08 04:32:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:52,714 INFO L475 AbstractCegarLoop]: Abstraction has 76577 states and 118532 transitions. [2019-09-08 04:32:52,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:32:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 76577 states and 118532 transitions. [2019-09-08 04:32:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 04:32:52,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:52,855 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:32:52,856 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash -456979548, now seen corresponding path program 1 times [2019-09-08 04:32:52,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:52,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:52,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:32:53,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:53,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-09-08 04:32:53,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 04:32:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 04:32:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:32:53,670 INFO L87 Difference]: Start difference. First operand 76577 states and 118532 transitions. Second operand 40 states. [2019-09-08 04:32:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:57,619 INFO L93 Difference]: Finished difference Result 124249 states and 193477 transitions. [2019-09-08 04:32:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 04:32:57,620 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 322 [2019-09-08 04:32:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:58,008 INFO L225 Difference]: With dead ends: 124249 [2019-09-08 04:32:58,009 INFO L226 Difference]: Without dead ends: 81342 [2019-09-08 04:32:58,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 04:32:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81342 states. [2019-09-08 04:33:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81342 to 81341. [2019-09-08 04:33:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81341 states. [2019-09-08 04:33:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81341 states to 81341 states and 125972 transitions. [2019-09-08 04:33:01,550 INFO L78 Accepts]: Start accepts. Automaton has 81341 states and 125972 transitions. Word has length 322 [2019-09-08 04:33:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:01,551 INFO L475 AbstractCegarLoop]: Abstraction has 81341 states and 125972 transitions. [2019-09-08 04:33:01,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 04:33:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 81341 states and 125972 transitions. [2019-09-08 04:33:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 04:33:01,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:01,676 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:01,676 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1822105801, now seen corresponding path program 1 times [2019-09-08 04:33:01,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:01,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:01,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:01,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 04:33:01,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:01,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:33:01,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:33:01,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:33:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:33:01,910 INFO L87 Difference]: Start difference. First operand 81341 states and 125972 transitions. Second operand 3 states. [2019-09-08 04:33:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:08,145 INFO L93 Difference]: Finished difference Result 227363 states and 371804 transitions. [2019-09-08 04:33:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:33:08,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 04:33:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:08,721 INFO L225 Difference]: With dead ends: 227363 [2019-09-08 04:33:08,721 INFO L226 Difference]: Without dead ends: 146071 [2019-09-08 04:33:08,868 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:33:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146071 states. [2019-09-08 04:33:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146071 to 145900. [2019-09-08 04:33:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145900 states. [2019-09-08 04:33:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145900 states to 145900 states and 231464 transitions. [2019-09-08 04:33:18,610 INFO L78 Accepts]: Start accepts. Automaton has 145900 states and 231464 transitions. Word has length 326 [2019-09-08 04:33:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:18,610 INFO L475 AbstractCegarLoop]: Abstraction has 145900 states and 231464 transitions. [2019-09-08 04:33:18,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:33:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 145900 states and 231464 transitions. [2019-09-08 04:33:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 04:33:18,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:18,824 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:18,824 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1277048066, now seen corresponding path program 1 times [2019-09-08 04:33:18,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:18,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:18,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:33:19,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:19,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:33:19,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:33:19,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:33:19,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:33:19,012 INFO L87 Difference]: Start difference. First operand 145900 states and 231464 transitions. Second operand 5 states. [2019-09-08 04:33:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:22,759 INFO L93 Difference]: Finished difference Result 236050 states and 379660 transitions. [2019-09-08 04:33:22,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:33:22,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-09-08 04:33:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:23,377 INFO L225 Difference]: With dead ends: 236050 [2019-09-08 04:33:23,377 INFO L226 Difference]: Without dead ends: 148112 [2019-09-08 04:33:23,602 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 04:33:24,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148112 states. [2019-09-08 04:33:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148112 to 147034. [2019-09-08 04:33:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147034 states. [2019-09-08 04:33:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147034 states to 147034 states and 232976 transitions. [2019-09-08 04:33:34,722 INFO L78 Accepts]: Start accepts. Automaton has 147034 states and 232976 transitions. Word has length 322 [2019-09-08 04:33:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:34,723 INFO L475 AbstractCegarLoop]: Abstraction has 147034 states and 232976 transitions. [2019-09-08 04:33:34,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:33:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 147034 states and 232976 transitions. [2019-09-08 04:33:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 04:33:34,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:34,982 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:33:34,983 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:34,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1182076383, now seen corresponding path program 1 times [2019-09-08 04:33:34,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:34,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:34,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:33:35,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:35,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:33:35,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:33:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:33:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:33:35,197 INFO L87 Difference]: Start difference. First operand 147034 states and 232976 transitions. Second operand 5 states. [2019-09-08 04:33:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:50,152 INFO L93 Difference]: Finished difference Result 355921 states and 594755 transitions. [2019-09-08 04:33:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:33:50,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-09-08 04:33:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:51,425 INFO L225 Difference]: With dead ends: 355921 [2019-09-08 04:33:51,425 INFO L226 Difference]: Without dead ends: 310930 [2019-09-08 04:33:51,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:33:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310930 states. [2019-09-08 04:34:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310930 to 310378. [2019-09-08 04:34:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310378 states. [2019-09-08 04:34:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310378 states to 310378 states and 511325 transitions. [2019-09-08 04:34:18,284 INFO L78 Accepts]: Start accepts. Automaton has 310378 states and 511325 transitions. Word has length 322 [2019-09-08 04:34:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:18,284 INFO L475 AbstractCegarLoop]: Abstraction has 310378 states and 511325 transitions. [2019-09-08 04:34:18,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:34:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 310378 states and 511325 transitions. [2019-09-08 04:34:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 04:34:18,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:18,719 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:18,719 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 614133982, now seen corresponding path program 1 times [2019-09-08 04:34:18,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:18,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 04:34:18,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:18,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:34:18,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:34:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:34:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:34:18,924 INFO L87 Difference]: Start difference. First operand 310378 states and 511325 transitions. Second operand 6 states. [2019-09-08 04:34:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:52,136 INFO L93 Difference]: Finished difference Result 847501 states and 1445136 transitions. [2019-09-08 04:34:52,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:34:52,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2019-09-08 04:34:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:56,022 INFO L225 Difference]: With dead ends: 847501 [2019-09-08 04:34:56,022 INFO L226 Difference]: Without dead ends: 625502 [2019-09-08 04:34:56,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:34:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625502 states. [2019-09-08 04:35:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625502 to 619150. [2019-09-08 04:35:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619150 states. [2019-09-08 04:35:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619150 states to 619150 states and 1029824 transitions. [2019-09-08 04:35:57,127 INFO L78 Accepts]: Start accepts. Automaton has 619150 states and 1029824 transitions. Word has length 324 [2019-09-08 04:35:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:57,127 INFO L475 AbstractCegarLoop]: Abstraction has 619150 states and 1029824 transitions. [2019-09-08 04:35:57,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:35:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 619150 states and 1029824 transitions. [2019-09-08 04:35:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 04:35:57,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:57,855 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 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, 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:35:57,855 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1369290199, now seen corresponding path program 1 times [2019-09-08 04:35:57,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:57,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:57,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:57,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:57,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 04:35:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:58,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:35:58,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:35:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:35:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:35:58,014 INFO L87 Difference]: Start difference. First operand 619150 states and 1029824 transitions. Second operand 3 states. [2019-09-08 04:37:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:37:00,460 INFO L93 Difference]: Finished difference Result 1530424 states and 2797856 transitions. [2019-09-08 04:37:00,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:37:00,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 04:37:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:37:05,827 INFO L225 Difference]: With dead ends: 1530424 [2019-09-08 04:37:05,827 INFO L226 Difference]: Without dead ends: 910489 [2019-09-08 04:37:09,023 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:37:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910489 states.