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_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:40:45,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:40:45,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:40:45,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:40:45,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:40:45,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:40:45,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:40:45,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:40:45,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:40:45,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:40:45,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:40:45,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:40:45,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:40:45,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:40:45,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:40:45,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:40:45,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:40:45,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:40:45,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:40:45,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:40:45,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:40:45,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:40:45,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:40:45,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:40:45,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:40:45,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:40:45,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:40:45,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:40:45,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:40:45,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:40:45,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:40:45,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:40:45,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:40:45,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:40:45,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:40:45,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:40:45,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:40:45,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:40:45,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:40:45,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:40:45,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:40:45,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:40:45,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:40:45,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:40:45,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:40:45,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:40:45,367 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:40:45,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:40:45,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:40:45,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:40:45,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:40:45,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:40:45,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:40:45,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:40:45,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:40:45,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:40:45,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:40:45,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:40:45,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:40:45,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:40:45,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:40:45,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:40:45,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:40:45,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:40:45,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:40:45,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:40:45,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:40:45,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:40:45,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:40:45,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:40:45,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:40:45,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:40:45,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:40:45,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:40:45,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:40:45,427 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:40:45,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product16.cil.c [2019-10-02 12:40:45,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68c2a134/341d8d5feae346628c79e0245e2e4404/FLAG38ca1e611 [2019-10-02 12:40:46,124 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:40:46,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product16.cil.c [2019-10-02 12:40:46,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68c2a134/341d8d5feae346628c79e0245e2e4404/FLAG38ca1e611 [2019-10-02 12:40:46,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68c2a134/341d8d5feae346628c79e0245e2e4404 [2019-10-02 12:40:46,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:40:46,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:40:46,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:40:46,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:40:46,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:40:46,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:40:46" (1/1) ... [2019-10-02 12:40:46,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a87286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:46, skipping insertion in model container [2019-10-02 12:40:46,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:40:46" (1/1) ... [2019-10-02 12:40:46,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:40:46,471 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:40:47,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:40:47,250 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:40:47,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:40:47,514 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:40:47,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47 WrapperNode [2019-10-02 12:40:47,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:40:47,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:40:47,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:40:47,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:40:47,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... [2019-10-02 12:40:47,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:40:47,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:40:47,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:40:47,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:40:47,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:40:47,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:40:47,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:40:47,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:40:47,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:40:47,773 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:40:47,774 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:40:47,774 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:40:47,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:40:47,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:40:47,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:40:47,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:40:47,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:40:47,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:40:47,776 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:40:47,777 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:40:47,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:40:47,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:40:47,781 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:40:47,781 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:40:47,781 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:40:47,781 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:40:47,782 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:40:47,782 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:40:47,782 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:40:47,782 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:40:47,783 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:40:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:40:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:40:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:40:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:40:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:40:47,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:40:47,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:40:47,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:40:47,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:40:47,785 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:40:47,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:40:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:40:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:40:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:40:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:40:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:40:47,786 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:40:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:40:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:40:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:40:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:40:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:40:47,788 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:40:47,788 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:40:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:40:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:40:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:40:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:40:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:40:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:40:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:40:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:40:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:40:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:40:47,791 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:40:47,791 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:40:47,791 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:40:47,792 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:40:47,792 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:40:47,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:40:47,792 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:40:47,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:40:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:40:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:40:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:40:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:40:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:40:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:40:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:40:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:40:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:40:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:40:47,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:40:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:40:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:40:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:40:47,797 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:40:47,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:40:47,798 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:40:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:40:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:40:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:40:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:40:47,799 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:40:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:40:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:40:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:40:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:40:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:40:47,801 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:40:47,801 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:40:47,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:40:47,801 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:40:47,802 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:40:47,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:40:47,802 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:40:47,802 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:40:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:40:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:40:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:40:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:40:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:40:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:40:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:40:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:40:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:40:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:40:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:40:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:40:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:40:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:40:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:40:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:40:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:40:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:40:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:40:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:40:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:40:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:40:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:40:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:40:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:40:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:40:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:40:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:40:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:40:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:40:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:40:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:40:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:40:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:40:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:40:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:40:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:40:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:40:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:40:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:40:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:40:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:40:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:40:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:40:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:40:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:40:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:40:47,827 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:40:47,828 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:40:47,828 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:40:47,828 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:40:47,829 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:40:47,829 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:40:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:40:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:40:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:40:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:40:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:40:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:40:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:40:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:40:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:40:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:40:47,834 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:40:47,835 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:40:47,836 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:40:47,837 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:40:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:40:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:40:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:40:50,207 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:40:50,208 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:40:50,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:40:50 BoogieIcfgContainer [2019-10-02 12:40:50,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:40:50,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:40:50,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:40:50,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:40:50,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:40:46" (1/3) ... [2019-10-02 12:40:50,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36531a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:40:50, skipping insertion in model container [2019-10-02 12:40:50,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:40:47" (2/3) ... [2019-10-02 12:40:50,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36531a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:40:50, skipping insertion in model container [2019-10-02 12:40:50,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:40:50" (3/3) ... [2019-10-02 12:40:50,218 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product16.cil.c [2019-10-02 12:40:50,229 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:40:50,242 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:40:50,260 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:40:50,302 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:40:50,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:40:50,302 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:40:50,303 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:40:50,303 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:40:50,303 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:40:50,303 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:40:50,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:40:50,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:40:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states. [2019-10-02 12:40:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:40:50,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:50,357 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:50,360 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:50,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:50,366 INFO L82 PathProgramCache]: Analyzing trace with hash -302652635, now seen corresponding path program 1 times [2019-10-02 12:40:50,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:50,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:50,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:50,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:40:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:40:51,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:40:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:40:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:40:51,034 INFO L87 Difference]: Start difference. First operand 473 states. Second operand 2 states. [2019-10-02 12:40:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:51,178 INFO L93 Difference]: Finished difference Result 688 states and 906 transitions. [2019-10-02 12:40:51,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:40:51,180 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 189 [2019-10-02 12:40:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:51,202 INFO L225 Difference]: With dead ends: 688 [2019-10-02 12:40:51,202 INFO L226 Difference]: Without dead ends: 450 [2019-10-02 12:40:51,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:40:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-02 12:40:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-10-02 12:40:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-02 12:40:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 596 transitions. [2019-10-02 12:40:51,301 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 596 transitions. Word has length 189 [2019-10-02 12:40:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:51,303 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 596 transitions. [2019-10-02 12:40:51,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:40:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 596 transitions. [2019-10-02 12:40:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:40:51,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:51,318 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:51,318 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:51,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash -182666753, now seen corresponding path program 1 times [2019-10-02 12:40:51,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:51,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:51,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:51,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:40:51,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:51,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:40:51,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:40:51,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:40:51,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:51,640 INFO L87 Difference]: Start difference. First operand 450 states and 596 transitions. Second operand 3 states. [2019-10-02 12:40:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:51,684 INFO L93 Difference]: Finished difference Result 671 states and 872 transitions. [2019-10-02 12:40:51,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:40:51,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 12:40:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:51,691 INFO L225 Difference]: With dead ends: 671 [2019-10-02 12:40:51,691 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 12:40:51,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 12:40:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-10-02 12:40:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-02 12:40:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 598 transitions. [2019-10-02 12:40:51,739 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 598 transitions. Word has length 190 [2019-10-02 12:40:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:51,740 INFO L475 AbstractCegarLoop]: Abstraction has 452 states and 598 transitions. [2019-10-02 12:40:51,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:40:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 598 transitions. [2019-10-02 12:40:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:40:51,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:51,746 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:51,747 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2135910709, now seen corresponding path program 1 times [2019-10-02 12:40:51,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:51,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:40:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:51,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:40:51,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:40:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:40:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:51,994 INFO L87 Difference]: Start difference. First operand 452 states and 598 transitions. Second operand 3 states. [2019-10-02 12:40:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:52,039 INFO L93 Difference]: Finished difference Result 880 states and 1194 transitions. [2019-10-02 12:40:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:40:52,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 12:40:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:52,045 INFO L225 Difference]: With dead ends: 880 [2019-10-02 12:40:52,045 INFO L226 Difference]: Without dead ends: 493 [2019-10-02 12:40:52,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-02 12:40:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2019-10-02 12:40:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-02 12:40:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 667 transitions. [2019-10-02 12:40:52,096 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 667 transitions. Word has length 196 [2019-10-02 12:40:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:52,097 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 667 transitions. [2019-10-02 12:40:52,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:40:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 667 transitions. [2019-10-02 12:40:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:40:52,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:52,109 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:52,110 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -318353265, now seen corresponding path program 1 times [2019-10-02 12:40:52,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:52,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:52,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:40:52,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:52,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:40:52,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:40:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:40:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:40:52,624 INFO L87 Difference]: Start difference. First operand 492 states and 667 transitions. Second operand 19 states. [2019-10-02 12:40:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:56,949 INFO L93 Difference]: Finished difference Result 1632 states and 2213 transitions. [2019-10-02 12:40:56,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:40:56,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 197 [2019-10-02 12:40:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:56,960 INFO L225 Difference]: With dead ends: 1632 [2019-10-02 12:40:56,960 INFO L226 Difference]: Without dead ends: 1427 [2019-10-02 12:40:56,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:40:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-10-02 12:40:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1390. [2019-10-02 12:40:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-10-02 12:40:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1897 transitions. [2019-10-02 12:40:57,055 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1897 transitions. Word has length 197 [2019-10-02 12:40:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:57,056 INFO L475 AbstractCegarLoop]: Abstraction has 1390 states and 1897 transitions. [2019-10-02 12:40:57,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:40:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1897 transitions. [2019-10-02 12:40:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:40:57,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:57,110 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:57,111 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash 309681099, now seen corresponding path program 1 times [2019-10-02 12:40:57,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:57,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:57,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:40:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:40:57,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:40:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:40:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:40:57,328 INFO L87 Difference]: Start difference. First operand 1390 states and 1897 transitions. Second operand 9 states. [2019-10-02 12:40:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:57,610 INFO L93 Difference]: Finished difference Result 2315 states and 3109 transitions. [2019-10-02 12:40:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:40:57,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-10-02 12:40:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:57,623 INFO L225 Difference]: With dead ends: 2315 [2019-10-02 12:40:57,623 INFO L226 Difference]: Without dead ends: 1436 [2019-10-02 12:40:57,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:40:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-10-02 12:40:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2019-10-02 12:40:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-10-02 12:40:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1970 transitions. [2019-10-02 12:40:57,737 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1970 transitions. Word has length 198 [2019-10-02 12:40:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:57,739 INFO L475 AbstractCegarLoop]: Abstraction has 1436 states and 1970 transitions. [2019-10-02 12:40:57,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:40:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1970 transitions. [2019-10-02 12:40:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:40:57,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:57,746 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:57,747 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1834515197, now seen corresponding path program 1 times [2019-10-02 12:40:57,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:57,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:57,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:57,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:57,980 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:40:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:40:57,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:40:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:40:57,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:40:57,982 INFO L87 Difference]: Start difference. First operand 1436 states and 1970 transitions. Second operand 5 states. [2019-10-02 12:40:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:59,228 INFO L93 Difference]: Finished difference Result 3494 states and 4736 transitions. [2019-10-02 12:40:59,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:40:59,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2019-10-02 12:40:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:59,251 INFO L225 Difference]: With dead ends: 3494 [2019-10-02 12:40:59,251 INFO L226 Difference]: Without dead ends: 3040 [2019-10-02 12:40:59,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:40:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2019-10-02 12:40:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 3020. [2019-10-02 12:40:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-10-02 12:40:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4117 transitions. [2019-10-02 12:40:59,476 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4117 transitions. Word has length 198 [2019-10-02 12:40:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:59,477 INFO L475 AbstractCegarLoop]: Abstraction has 3020 states and 4117 transitions. [2019-10-02 12:40:59,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:40:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4117 transitions. [2019-10-02 12:40:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:40:59,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:59,487 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:40:59,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1351636900, now seen corresponding path program 1 times [2019-10-02 12:40:59,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:59,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:59,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:40:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:40:59,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:40:59,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:40:59,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:40:59,669 INFO L87 Difference]: Start difference. First operand 3020 states and 4117 transitions. Second operand 6 states. [2019-10-02 12:41:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:00,459 INFO L93 Difference]: Finished difference Result 8271 states and 11200 transitions. [2019-10-02 12:41:00,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:41:00,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-10-02 12:41:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:00,506 INFO L225 Difference]: With dead ends: 8271 [2019-10-02 12:41:00,506 INFO L226 Difference]: Without dead ends: 6075 [2019-10-02 12:41:00,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2019-10-02 12:41:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 6032. [2019-10-02 12:41:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6032 states. [2019-10-02 12:41:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 8228 transitions. [2019-10-02 12:41:00,912 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 8228 transitions. Word has length 198 [2019-10-02 12:41:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:00,914 INFO L475 AbstractCegarLoop]: Abstraction has 6032 states and 8228 transitions. [2019-10-02 12:41:00,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 8228 transitions. [2019-10-02 12:41:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:41:00,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:00,930 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:00,931 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:00,933 INFO L82 PathProgramCache]: Analyzing trace with hash 156692310, now seen corresponding path program 1 times [2019-10-02 12:41:00,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:00,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:00,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:01,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:41:01,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:41:01,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:41:01,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:01,167 INFO L87 Difference]: Start difference. First operand 6032 states and 8228 transitions. Second operand 9 states. [2019-10-02 12:41:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:01,572 INFO L93 Difference]: Finished difference Result 11011 states and 14871 transitions. [2019-10-02 12:41:01,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:41:01,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-10-02 12:41:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:01,615 INFO L225 Difference]: With dead ends: 11011 [2019-10-02 12:41:01,616 INFO L226 Difference]: Without dead ends: 6562 [2019-10-02 12:41:01,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:41:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2019-10-02 12:41:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6532. [2019-10-02 12:41:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-10-02 12:41:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 8968 transitions. [2019-10-02 12:41:02,052 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 8968 transitions. Word has length 199 [2019-10-02 12:41:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:02,053 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 8968 transitions. [2019-10-02 12:41:02,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:41:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 8968 transitions. [2019-10-02 12:41:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:41:02,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:02,070 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:02,070 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1972860762, now seen corresponding path program 1 times [2019-10-02 12:41:02,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:02,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:02,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:02,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:02,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:41:02,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:41:02,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:41:02,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:41:02,260 INFO L87 Difference]: Start difference. First operand 6532 states and 8968 transitions. Second operand 6 states. [2019-10-02 12:41:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:03,271 INFO L93 Difference]: Finished difference Result 18148 states and 24739 transitions. [2019-10-02 12:41:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:41:03,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-10-02 12:41:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:03,387 INFO L225 Difference]: With dead ends: 18148 [2019-10-02 12:41:03,388 INFO L226 Difference]: Without dead ends: 13199 [2019-10-02 12:41:03,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13199 states. [2019-10-02 12:41:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13199 to 13036. [2019-10-02 12:41:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13036 states. [2019-10-02 12:41:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13036 states to 13036 states and 17919 transitions. [2019-10-02 12:41:04,123 INFO L78 Accepts]: Start accepts. Automaton has 13036 states and 17919 transitions. Word has length 200 [2019-10-02 12:41:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:04,125 INFO L475 AbstractCegarLoop]: Abstraction has 13036 states and 17919 transitions. [2019-10-02 12:41:04,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13036 states and 17919 transitions. [2019-10-02 12:41:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:41:04,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:04,157 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:04,158 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1385655780, now seen corresponding path program 1 times [2019-10-02 12:41:04,158 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:04,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:04,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:04,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:04,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:04,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:41:04,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:41:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:41:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:04,466 INFO L87 Difference]: Start difference. First operand 13036 states and 17919 transitions. Second operand 9 states. [2019-10-02 12:41:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:05,027 INFO L93 Difference]: Finished difference Result 24391 states and 33443 transitions. [2019-10-02 12:41:05,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:41:05,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2019-10-02 12:41:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:05,106 INFO L225 Difference]: With dead ends: 24391 [2019-10-02 12:41:05,106 INFO L226 Difference]: Without dead ends: 14456 [2019-10-02 12:41:05,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:41:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14456 states. [2019-10-02 12:41:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14456 to 14326. [2019-10-02 12:41:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14326 states. [2019-10-02 12:41:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14326 states to 14326 states and 19899 transitions. [2019-10-02 12:41:06,785 INFO L78 Accepts]: Start accepts. Automaton has 14326 states and 19899 transitions. Word has length 201 [2019-10-02 12:41:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:06,786 INFO L475 AbstractCegarLoop]: Abstraction has 14326 states and 19899 transitions. [2019-10-02 12:41:06,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:41:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 14326 states and 19899 transitions. [2019-10-02 12:41:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 12:41:06,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:06,818 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:06,819 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash -221138788, now seen corresponding path program 1 times [2019-10-02 12:41:06,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:06,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:06,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:41:06,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:41:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:41:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:41:06,987 INFO L87 Difference]: Start difference. First operand 14326 states and 19899 transitions. Second operand 6 states. [2019-10-02 12:41:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:08,066 INFO L93 Difference]: Finished difference Result 39463 states and 54578 transitions. [2019-10-02 12:41:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:41:08,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-10-02 12:41:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:08,446 INFO L225 Difference]: With dead ends: 39463 [2019-10-02 12:41:08,447 INFO L226 Difference]: Without dead ends: 25937 [2019-10-02 12:41:08,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25937 states. [2019-10-02 12:41:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25937 to 25642. [2019-10-02 12:41:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25642 states. [2019-10-02 12:41:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25642 states to 25642 states and 35837 transitions. [2019-10-02 12:41:09,773 INFO L78 Accepts]: Start accepts. Automaton has 25642 states and 35837 transitions. Word has length 202 [2019-10-02 12:41:09,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:09,774 INFO L475 AbstractCegarLoop]: Abstraction has 25642 states and 35837 transitions. [2019-10-02 12:41:09,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 25642 states and 35837 transitions. [2019-10-02 12:41:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:41:09,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:09,822 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:09,823 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:09,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1456951732, now seen corresponding path program 1 times [2019-10-02 12:41:09,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:09,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:09,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:10,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:10,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:10,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:10,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:10,165 INFO L87 Difference]: Start difference. First operand 25642 states and 35837 transitions. Second operand 3 states. [2019-10-02 12:41:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:10,853 INFO L93 Difference]: Finished difference Result 53186 states and 75254 transitions. [2019-10-02 12:41:10,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:10,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-10-02 12:41:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:10,993 INFO L225 Difference]: With dead ends: 53186 [2019-10-02 12:41:10,994 INFO L226 Difference]: Without dead ends: 27607 [2019-10-02 12:41:11,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27607 states. [2019-10-02 12:41:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27607 to 27586. [2019-10-02 12:41:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27586 states. [2019-10-02 12:41:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27586 states to 27586 states and 39419 transitions. [2019-10-02 12:41:13,525 INFO L78 Accepts]: Start accepts. Automaton has 27586 states and 39419 transitions. Word has length 211 [2019-10-02 12:41:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:13,525 INFO L475 AbstractCegarLoop]: Abstraction has 27586 states and 39419 transitions. [2019-10-02 12:41:13,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27586 states and 39419 transitions. [2019-10-02 12:41:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 12:41:13,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:13,560 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:13,560 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:13,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -719397532, now seen corresponding path program 1 times [2019-10-02 12:41:13,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:13,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:13,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:13,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:13,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:13,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:13,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:13,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:13,691 INFO L87 Difference]: Start difference. First operand 27586 states and 39419 transitions. Second operand 3 states. [2019-10-02 12:41:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:14,728 INFO L93 Difference]: Finished difference Result 58778 states and 85616 transitions. [2019-10-02 12:41:14,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:14,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-10-02 12:41:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:14,886 INFO L225 Difference]: With dead ends: 58778 [2019-10-02 12:41:14,886 INFO L226 Difference]: Without dead ends: 31255 [2019-10-02 12:41:14,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31255 states. [2019-10-02 12:41:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31255 to 31234. [2019-10-02 12:41:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31234 states. [2019-10-02 12:41:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31234 states to 31234 states and 46151 transitions. [2019-10-02 12:41:17,199 INFO L78 Accepts]: Start accepts. Automaton has 31234 states and 46151 transitions. Word has length 214 [2019-10-02 12:41:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:17,200 INFO L475 AbstractCegarLoop]: Abstraction has 31234 states and 46151 transitions. [2019-10-02 12:41:17,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31234 states and 46151 transitions. [2019-10-02 12:41:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:41:17,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:17,268 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:17,269 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash -569401298, now seen corresponding path program 1 times [2019-10-02 12:41:17,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:17,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:17,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:17,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:17,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:17,464 INFO L87 Difference]: Start difference. First operand 31234 states and 46151 transitions. Second operand 3 states. [2019-10-02 12:41:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:18,675 INFO L93 Difference]: Finished difference Result 69434 states and 105140 transitions. [2019-10-02 12:41:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:18,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-10-02 12:41:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:18,882 INFO L225 Difference]: With dead ends: 69434 [2019-10-02 12:41:18,883 INFO L226 Difference]: Without dead ends: 38263 [2019-10-02 12:41:18,982 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38263 states. [2019-10-02 12:41:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38263 to 38242. [2019-10-02 12:41:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38242 states. [2019-10-02 12:41:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38242 states to 38242 states and 58847 transitions. [2019-10-02 12:41:22,158 INFO L78 Accepts]: Start accepts. Automaton has 38242 states and 58847 transitions. Word has length 213 [2019-10-02 12:41:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:22,159 INFO L475 AbstractCegarLoop]: Abstraction has 38242 states and 58847 transitions. [2019-10-02 12:41:22,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 38242 states and 58847 transitions. [2019-10-02 12:41:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:41:22,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:22,227 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:22,228 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:22,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1059931004, now seen corresponding path program 1 times [2019-10-02 12:41:22,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:22,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:22,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:22,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:22,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:22,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:22,596 INFO L87 Difference]: Start difference. First operand 38242 states and 58847 transitions. Second operand 3 states. [2019-10-02 12:41:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:23,566 INFO L93 Difference]: Finished difference Result 89882 states and 142076 transitions. [2019-10-02 12:41:23,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:23,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-02 12:41:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:23,797 INFO L225 Difference]: With dead ends: 89882 [2019-10-02 12:41:23,797 INFO L226 Difference]: Without dead ends: 51703 [2019-10-02 12:41:23,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51703 states. [2019-10-02 12:41:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51703 to 51682. [2019-10-02 12:41:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51682 states. [2019-10-02 12:41:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51682 states to 51682 states and 82895 transitions. [2019-10-02 12:41:27,546 INFO L78 Accepts]: Start accepts. Automaton has 51682 states and 82895 transitions. Word has length 216 [2019-10-02 12:41:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:27,546 INFO L475 AbstractCegarLoop]: Abstraction has 51682 states and 82895 transitions. [2019-10-02 12:41:27,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51682 states and 82895 transitions. [2019-10-02 12:41:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 12:41:27,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:27,647 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:27,648 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 907809038, now seen corresponding path program 1 times [2019-10-02 12:41:27,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:27,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:28,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:41:28,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:41:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:41:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:41:28,190 INFO L87 Difference]: Start difference. First operand 51682 states and 82895 transitions. Second operand 7 states. [2019-10-02 12:41:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:33,067 INFO L93 Difference]: Finished difference Result 111789 states and 172114 transitions. [2019-10-02 12:41:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:41:33,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 215 [2019-10-02 12:41:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:33,624 INFO L225 Difference]: With dead ends: 111789 [2019-10-02 12:41:33,624 INFO L226 Difference]: Without dead ends: 90035 [2019-10-02 12:41:33,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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-10-02 12:41:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90035 states. [2019-10-02 12:41:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90035 to 89461. [2019-10-02 12:41:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89461 states. [2019-10-02 12:41:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89461 states to 89461 states and 136896 transitions. [2019-10-02 12:41:37,510 INFO L78 Accepts]: Start accepts. Automaton has 89461 states and 136896 transitions. Word has length 215 [2019-10-02 12:41:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:37,510 INFO L475 AbstractCegarLoop]: Abstraction has 89461 states and 136896 transitions. [2019-10-02 12:41:37,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:41:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 89461 states and 136896 transitions. [2019-10-02 12:41:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:41:37,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:37,629 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:37,630 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1656476220, now seen corresponding path program 1 times [2019-10-02 12:41:37,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:37,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:37,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:37,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:37,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:41:37,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:41:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:41:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:37,830 INFO L87 Difference]: Start difference. First operand 89461 states and 136896 transitions. Second operand 9 states. [2019-10-02 12:41:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:40,100 INFO L93 Difference]: Finished difference Result 142454 states and 212561 transitions. [2019-10-02 12:41:40,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:41:40,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-10-02 12:41:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:40,519 INFO L225 Difference]: With dead ends: 142454 [2019-10-02 12:41:40,519 INFO L226 Difference]: Without dead ends: 89401 [2019-10-02 12:41:40,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:41:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89401 states. [2019-10-02 12:41:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89401 to 89026. [2019-10-02 12:41:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89026 states. [2019-10-02 12:41:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89026 states to 89026 states and 135901 transitions. [2019-10-02 12:41:46,895 INFO L78 Accepts]: Start accepts. Automaton has 89026 states and 135901 transitions. Word has length 218 [2019-10-02 12:41:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:46,896 INFO L475 AbstractCegarLoop]: Abstraction has 89026 states and 135901 transitions. [2019-10-02 12:41:46,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:41:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 89026 states and 135901 transitions. [2019-10-02 12:41:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:41:47,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:47,623 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:47,624 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1958723520, now seen corresponding path program 1 times [2019-10-02 12:41:47,624 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:47,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:47,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:48,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:41:48,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:41:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:41:48,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:41:48,121 INFO L87 Difference]: Start difference. First operand 89026 states and 135901 transitions. Second operand 24 states. [2019-10-02 12:41:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:53,858 INFO L93 Difference]: Finished difference Result 163380 states and 247778 transitions. [2019-10-02 12:41:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:41:53,858 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 216 [2019-10-02 12:41:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:54,293 INFO L225 Difference]: With dead ends: 163380 [2019-10-02 12:41:54,293 INFO L226 Difference]: Without dead ends: 96117 [2019-10-02 12:41:54,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 12:41:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96117 states. [2019-10-02 12:41:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96117 to 91868. [2019-10-02 12:41:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91868 states. [2019-10-02 12:41:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91868 states to 91868 states and 140029 transitions. [2019-10-02 12:41:57,787 INFO L78 Accepts]: Start accepts. Automaton has 91868 states and 140029 transitions. Word has length 216 [2019-10-02 12:41:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:57,788 INFO L475 AbstractCegarLoop]: Abstraction has 91868 states and 140029 transitions. [2019-10-02 12:41:57,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:41:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 91868 states and 140029 transitions. [2019-10-02 12:41:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 12:41:57,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:57,938 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:41:57,938 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash -137374558, now seen corresponding path program 1 times [2019-10-02 12:41:57,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:57,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:57,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:57,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:57,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:58,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:58,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:41:58,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:41:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:41:58,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:41:58,184 INFO L87 Difference]: Start difference. First operand 91868 states and 140029 transitions. Second operand 10 states. [2019-10-02 12:42:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:00,473 INFO L93 Difference]: Finished difference Result 92293 states and 140593 transitions. [2019-10-02 12:42:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:42:00,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2019-10-02 12:42:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:00,815 INFO L225 Difference]: With dead ends: 92293 [2019-10-02 12:42:00,815 INFO L226 Difference]: Without dead ends: 91798 [2019-10-02 12:42:00,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:42:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91798 states. [2019-10-02 12:42:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91798 to 91798. [2019-10-02 12:42:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91798 states. [2019-10-02 12:42:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91798 states to 91798 states and 139679 transitions. [2019-10-02 12:42:06,974 INFO L78 Accepts]: Start accepts. Automaton has 91798 states and 139679 transitions. Word has length 220 [2019-10-02 12:42:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:06,975 INFO L475 AbstractCegarLoop]: Abstraction has 91798 states and 139679 transitions. [2019-10-02 12:42:06,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:42:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 91798 states and 139679 transitions. [2019-10-02 12:42:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:42:07,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:07,103 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:42:07,103 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1689915209, now seen corresponding path program 1 times [2019-10-02 12:42:07,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:07,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:07,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:07,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:42:07,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:42:07,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:42:07,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:42:07,241 INFO L87 Difference]: Start difference. First operand 91798 states and 139679 transitions. Second operand 5 states. [2019-10-02 12:42:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:09,680 INFO L93 Difference]: Finished difference Result 141783 states and 207866 transitions. [2019-10-02 12:42:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:42:09,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-02 12:42:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:10,000 INFO L225 Difference]: With dead ends: 141783 [2019-10-02 12:42:10,000 INFO L226 Difference]: Without dead ends: 93646 [2019-10-02 12:42:10,097 INFO L640 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-10-02 12:42:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93646 states. [2019-10-02 12:42:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93646 to 92778. [2019-10-02 12:42:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92778 states. [2019-10-02 12:42:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92778 states to 92778 states and 140750 transitions. [2019-10-02 12:42:14,090 INFO L78 Accepts]: Start accepts. Automaton has 92778 states and 140750 transitions. Word has length 225 [2019-10-02 12:42:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:14,091 INFO L475 AbstractCegarLoop]: Abstraction has 92778 states and 140750 transitions. [2019-10-02 12:42:14,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:42:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 92778 states and 140750 transitions. [2019-10-02 12:42:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:42:14,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:14,202 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:42:14,202 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 305581585, now seen corresponding path program 1 times [2019-10-02 12:42:14,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:14,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:14,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:14,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:42:14,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:42:14,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:42:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:42:14,368 INFO L87 Difference]: Start difference. First operand 92778 states and 140750 transitions. Second operand 6 states. [2019-10-02 12:42:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:20,654 INFO L93 Difference]: Finished difference Result 233672 states and 351088 transitions. [2019-10-02 12:42:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:42:20,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-10-02 12:42:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:21,283 INFO L225 Difference]: With dead ends: 233672 [2019-10-02 12:42:21,284 INFO L226 Difference]: Without dead ends: 184879 [2019-10-02 12:42:21,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:42:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184879 states. [2019-10-02 12:42:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184879 to 182666. [2019-10-02 12:42:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182666 states. [2019-10-02 12:42:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182666 states to 182666 states and 281723 transitions. [2019-10-02 12:42:29,926 INFO L78 Accepts]: Start accepts. Automaton has 182666 states and 281723 transitions. Word has length 225 [2019-10-02 12:42:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:29,927 INFO L475 AbstractCegarLoop]: Abstraction has 182666 states and 281723 transitions. [2019-10-02 12:42:29,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:42:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 182666 states and 281723 transitions. [2019-10-02 12:42:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 12:42:30,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:30,234 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:30,234 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1094427977, now seen corresponding path program 1 times [2019-10-02 12:42:30,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:30,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:30,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:42:30,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:42:30,401 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:42:30,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:30,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 2730 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:42:30,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:42:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:42:31,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:42:31,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 12:42:31,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:42:31,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:42:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:42:31,265 INFO L87 Difference]: Start difference. First operand 182666 states and 281723 transitions. Second operand 13 states. [2019-10-02 12:42:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:44,607 INFO L93 Difference]: Finished difference Result 376595 states and 577365 transitions. [2019-10-02 12:42:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:42:44,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2019-10-02 12:42:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:45,785 INFO L225 Difference]: With dead ends: 376595 [2019-10-02 12:42:45,786 INFO L226 Difference]: Without dead ends: 192881 [2019-10-02 12:42:46,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:42:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192881 states. [2019-10-02 12:43:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192881 to 188648. [2019-10-02 12:43:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188648 states. [2019-10-02 12:43:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188648 states to 188648 states and 283704 transitions. [2019-10-02 12:43:01,590 INFO L78 Accepts]: Start accepts. Automaton has 188648 states and 283704 transitions. Word has length 245 [2019-10-02 12:43:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:01,591 INFO L475 AbstractCegarLoop]: Abstraction has 188648 states and 283704 transitions. [2019-10-02 12:43:01,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:43:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 188648 states and 283704 transitions. [2019-10-02 12:43:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:43:02,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:02,049 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 12:43:02,050 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1057882710, now seen corresponding path program 1 times [2019-10-02 12:43:02,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:02,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:02,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:43:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:02,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:43:02,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:43:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:43:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:43:02,275 INFO L87 Difference]: Start difference. First operand 188648 states and 283704 transitions. Second operand 8 states. [2019-10-02 12:43:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:24,047 INFO L93 Difference]: Finished difference Result 571742 states and 925718 transitions. [2019-10-02 12:43:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:43:24,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 280 [2019-10-02 12:43:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:25,697 INFO L225 Difference]: With dead ends: 571742 [2019-10-02 12:43:25,698 INFO L226 Difference]: Without dead ends: 383171 [2019-10-02 12:43:26,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:43:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383171 states. [2019-10-02 12:43:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383171 to 347218. [2019-10-02 12:43:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347218 states. [2019-10-02 12:43:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347218 states to 347218 states and 562497 transitions. [2019-10-02 12:43:52,506 INFO L78 Accepts]: Start accepts. Automaton has 347218 states and 562497 transitions. Word has length 280 [2019-10-02 12:43:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:52,506 INFO L475 AbstractCegarLoop]: Abstraction has 347218 states and 562497 transitions. [2019-10-02 12:43:52,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:43:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 347218 states and 562497 transitions. [2019-10-02 12:43:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-02 12:43:53,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:53,398 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:43:53,398 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:53,398 INFO L82 PathProgramCache]: Analyzing trace with hash -319981923, now seen corresponding path program 1 times [2019-10-02 12:43:53,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:53,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:43:53,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:53,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:43:53,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:43:53,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:43:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:43:53,591 INFO L87 Difference]: Start difference. First operand 347218 states and 562497 transitions. Second operand 8 states. [2019-10-02 12:44:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:35,748 INFO L93 Difference]: Finished difference Result 1053884 states and 1838225 transitions. [2019-10-02 12:44:35,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:44:35,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 271 [2019-10-02 12:44:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:39,126 INFO L225 Difference]: With dead ends: 1053884 [2019-10-02 12:44:39,126 INFO L226 Difference]: Without dead ends: 706743 [2019-10-02 12:44:53,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:44:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706743 states. [2019-10-02 12:46:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706743 to 649878. [2019-10-02 12:46:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649878 states. [2019-10-02 12:46:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649878 states to 649878 states and 1133541 transitions. [2019-10-02 12:46:08,966 INFO L78 Accepts]: Start accepts. Automaton has 649878 states and 1133541 transitions. Word has length 271 [2019-10-02 12:46:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:08,966 INFO L475 AbstractCegarLoop]: Abstraction has 649878 states and 1133541 transitions. [2019-10-02 12:46:08,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:46:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 649878 states and 1133541 transitions. [2019-10-02 12:46:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 12:46:12,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:12,171 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:12,172 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1215975800, now seen corresponding path program 1 times [2019-10-02 12:46:12,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:46:12,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:12,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:46:12,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:46:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:46:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:46:12,384 INFO L87 Difference]: Start difference. First operand 649878 states and 1133541 transitions. Second operand 8 states. [2019-10-02 12:47:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:54,136 INFO L93 Difference]: Finished difference Result 1973672 states and 3703085 transitions. [2019-10-02 12:47:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:47:54,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 281 [2019-10-02 12:47:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:02,414 INFO L225 Difference]: With dead ends: 1973672 [2019-10-02 12:48:02,414 INFO L226 Difference]: Without dead ends: 1323871 [2019-10-02 12:48:04,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:48:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323871 states.