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_spec11_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:46:47,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:46:47,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:46:47,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:46:47,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:46:47,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:46:47,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:46:47,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:46:47,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:46:47,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:46:47,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:46:47,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:46:47,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:46:47,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:46:47,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:46:47,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:46:47,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:46:47,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:46:47,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:46:47,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:46:47,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:46:47,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:46:47,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:46:47,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:46:47,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:46:47,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:46:47,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:46:47,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:46:47,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:46:47,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:46:47,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:46:47,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:46:47,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:46:47,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:46:47,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:46:47,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:46:47,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:46:47,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:46:47,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:46:47,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:46:47,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:46:47,547 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:46:47,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:46:47,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:46:47,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:46:47,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:46:47,565 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:46:47,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:46:47,566 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:46:47,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:46:47,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:46:47,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:46:47,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:46:47,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:46:47,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:46:47,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:46:47,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:46:47,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:46:47,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:46:47,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:46:47,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:46:47,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:46:47,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:46:47,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:46:47,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:46:47,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:46:47,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:46:47,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:46:47,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:46:47,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:46:47,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:46:47,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:46:47,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:46:47,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:46:47,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:46:47,648 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:46:47,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product26.cil.c [2019-10-02 12:46:47,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176527ab1/03ecd1e16d0c4075a50dd4726f532175/FLAG2446fa685 [2019-10-02 12:46:48,369 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:46:48,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product26.cil.c [2019-10-02 12:46:48,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176527ab1/03ecd1e16d0c4075a50dd4726f532175/FLAG2446fa685 [2019-10-02 12:46:48,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/176527ab1/03ecd1e16d0c4075a50dd4726f532175 [2019-10-02 12:46:48,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:46:48,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:46:48,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:46:48,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:46:48,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:46:48,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:46:48" (1/1) ... [2019-10-02 12:46:48,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5263035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:48, skipping insertion in model container [2019-10-02 12:46:48,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:46:48" (1/1) ... [2019-10-02 12:46:48,570 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:46:48,681 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:46:49,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:46:49,625 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:46:49,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:46:49,877 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:46:49,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49 WrapperNode [2019-10-02 12:46:49,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:46:49,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:46:49,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:46:49,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:46:49,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:49,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:49,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:49,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:50,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:50,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:50,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (1/1) ... [2019-10-02 12:46:50,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:46:50,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:46:50,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:46:50,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:46:50,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (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:46:50,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:46:50,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:46:50,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:46:50,185 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:46:50,185 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:46:50,185 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:46:50,185 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:46:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:46:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:46:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:46:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:46:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:46:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:46:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:46:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:46:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:46:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:46:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:46:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:46:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:46:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:46:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:46:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:46:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:46:50,189 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:46:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:46:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:46:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:46:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:46:50,190 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:46:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:46:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:46:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:46:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:46:50,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-02 12:46:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:46:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:46:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:46:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:46:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:46:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:46:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:46:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:46:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:46:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:46:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:46:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:46:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:46:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:46:50,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:46:50,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:46:50,196 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:46:50,196 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:46:50,196 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:46:50,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:46:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:46:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:46:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:46:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:46:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:46:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:46:50,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:46:50,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:46:50,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:46:50,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:46:50,199 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:46:50,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:46:50,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:46:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:46:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:46:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:46:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:46:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:46:50,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:46:50,201 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:46:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:46:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:46:50,204 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:46:50,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:46:50,204 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:46:50,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:46:50,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:46:50,204 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:46:50,204 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:46:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:46:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:46:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:46:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:46:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:46:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:46:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:46:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:46:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:46:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:46:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:46:50,206 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:46:50,207 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:46:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:46:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:46:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:46:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:46:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:46:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:46:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:46:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:46:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:46:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:46:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:46:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:46:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:46:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:46:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:46:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:46:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:46:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:46:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:46:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:46:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:46:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:46:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:46:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:46:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:46:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:46:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:46:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:46:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:46:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:46:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:46:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:46:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:46:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:46:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:46:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:46:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:46:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:46:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:46:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:46:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:46:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:46:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 12:46:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:46:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:46:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:46:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:46:50,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:46:52,437 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:46:52,437 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:46:52,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:46:52 BoogieIcfgContainer [2019-10-02 12:46:52,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:46:52,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:46:52,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:46:52,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:46:52,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:46:48" (1/3) ... [2019-10-02 12:46:52,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dab396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:46:52, skipping insertion in model container [2019-10-02 12:46:52,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:46:49" (2/3) ... [2019-10-02 12:46:52,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dab396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:46:52, skipping insertion in model container [2019-10-02 12:46:52,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:46:52" (3/3) ... [2019-10-02 12:46:52,447 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product26.cil.c [2019-10-02 12:46:52,457 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:46:52,467 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:46:52,484 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:46:52,520 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:46:52,520 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:46:52,521 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:46:52,521 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:46:52,521 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:46:52,521 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:46:52,521 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:46:52,521 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:46:52,521 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:46:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-10-02 12:46:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:46:52,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:52,578 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:52,581 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 900111105, now seen corresponding path program 1 times [2019-10-02 12:46:52,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:52,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:52,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:53,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:53,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:46:53,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:46:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:46:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:46:53,347 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-10-02 12:46:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:53,453 INFO L93 Difference]: Finished difference Result 871 states and 1182 transitions. [2019-10-02 12:46:53,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:46:53,457 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-10-02 12:46:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:53,497 INFO L225 Difference]: With dead ends: 871 [2019-10-02 12:46:53,497 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 12:46:53,511 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:46:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 12:46:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-02 12:46:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 12:46:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 775 transitions. [2019-10-02 12:46:53,662 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 775 transitions. Word has length 195 [2019-10-02 12:46:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:53,664 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 775 transitions. [2019-10-02 12:46:53,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:46:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2019-10-02 12:46:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:46:53,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:53,671 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:53,672 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:53,672 INFO L82 PathProgramCache]: Analyzing trace with hash -156800952, now seen corresponding path program 1 times [2019-10-02 12:46:53,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:53,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:53,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:53,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:46:53,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:46:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:46:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:46:53,950 INFO L87 Difference]: Start difference. First operand 569 states and 775 transitions. Second operand 3 states. [2019-10-02 12:46:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:54,003 INFO L93 Difference]: Finished difference Result 854 states and 1144 transitions. [2019-10-02 12:46:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:46:54,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 12:46:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:54,010 INFO L225 Difference]: With dead ends: 854 [2019-10-02 12:46:54,010 INFO L226 Difference]: Without dead ends: 572 [2019-10-02 12:46:54,013 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:46:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-02 12:46:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 571. [2019-10-02 12:46:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 12:46:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 777 transitions. [2019-10-02 12:46:54,040 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 777 transitions. Word has length 196 [2019-10-02 12:46:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:54,040 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 777 transitions. [2019-10-02 12:46:54,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:46:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 777 transitions. [2019-10-02 12:46:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:46:54,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:54,045 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:54,046 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1398291401, now seen corresponding path program 1 times [2019-10-02 12:46:54,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:54,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:54,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:46:54,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:46:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:46:54,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:46:54,327 INFO L87 Difference]: Start difference. First operand 571 states and 777 transitions. Second operand 3 states. [2019-10-02 12:46:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:54,379 INFO L93 Difference]: Finished difference Result 1122 states and 1558 transitions. [2019-10-02 12:46:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:46:54,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-02 12:46:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:54,390 INFO L225 Difference]: With dead ends: 1122 [2019-10-02 12:46:54,390 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 12:46:54,393 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:46:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 12:46:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2019-10-02 12:46:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 12:46:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 852 transitions. [2019-10-02 12:46:54,429 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 852 transitions. Word has length 208 [2019-10-02 12:46:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:54,430 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 852 transitions. [2019-10-02 12:46:54,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:46:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 852 transitions. [2019-10-02 12:46:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:46:54,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:54,436 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:54,437 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1218822354, now seen corresponding path program 1 times [2019-10-02 12:46:54,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:54,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:54,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:46:54,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:54,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:46:54,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:46:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:46:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:46:54,654 INFO L87 Difference]: Start difference. First operand 615 states and 852 transitions. Second operand 3 states. [2019-10-02 12:46:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:54,697 INFO L93 Difference]: Finished difference Result 1251 states and 1778 transitions. [2019-10-02 12:46:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:46:54,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-02 12:46:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:54,702 INFO L225 Difference]: With dead ends: 1251 [2019-10-02 12:46:54,703 INFO L226 Difference]: Without dead ends: 701 [2019-10-02 12:46:54,705 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:46:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-10-02 12:46:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-10-02 12:46:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-02 12:46:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 996 transitions. [2019-10-02 12:46:54,736 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 996 transitions. Word has length 209 [2019-10-02 12:46:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:54,737 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 996 transitions. [2019-10-02 12:46:54,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:46:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 996 transitions. [2019-10-02 12:46:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:46:54,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:54,743 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:54,743 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1024895096, now seen corresponding path program 1 times [2019-10-02 12:46:54,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:54,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:54,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:54,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:46:55,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:55,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:46:55,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:46:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:46:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:46:55,330 INFO L87 Difference]: Start difference. First operand 700 states and 996 transitions. Second operand 19 states. [2019-10-02 12:47:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:00,289 INFO L93 Difference]: Finished difference Result 2240 states and 3191 transitions. [2019-10-02 12:47:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:47:00,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 212 [2019-10-02 12:47:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:00,303 INFO L225 Difference]: With dead ends: 2240 [2019-10-02 12:47:00,303 INFO L226 Difference]: Without dead ends: 1971 [2019-10-02 12:47:00,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:47:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-10-02 12:47:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1934. [2019-10-02 12:47:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-10-02 12:47:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2772 transitions. [2019-10-02 12:47:00,399 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2772 transitions. Word has length 212 [2019-10-02 12:47:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:00,400 INFO L475 AbstractCegarLoop]: Abstraction has 1934 states and 2772 transitions. [2019-10-02 12:47:00,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:47:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2772 transitions. [2019-10-02 12:47:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:47:00,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:00,409 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:00,409 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:00,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1577885369, now seen corresponding path program 1 times [2019-10-02 12:47:00,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:00,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:00,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:00,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:47:00,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:47:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:47:00,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:47:00,678 INFO L87 Difference]: Start difference. First operand 1934 states and 2772 transitions. Second operand 11 states. [2019-10-02 12:47:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:01,174 INFO L93 Difference]: Finished difference Result 3191 states and 4529 transitions. [2019-10-02 12:47:01,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:47:01,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-10-02 12:47:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:01,190 INFO L225 Difference]: With dead ends: 3191 [2019-10-02 12:47:01,191 INFO L226 Difference]: Without dead ends: 2056 [2019-10-02 12:47:01,196 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:47:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-10-02 12:47:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-10-02 12:47:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-02 12:47:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2969 transitions. [2019-10-02 12:47:01,339 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2969 transitions. Word has length 213 [2019-10-02 12:47:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:01,340 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2969 transitions. [2019-10-02 12:47:01,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:47:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2969 transitions. [2019-10-02 12:47:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:47:01,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:01,350 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:01,351 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1520134915, now seen corresponding path program 1 times [2019-10-02 12:47:01,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:01,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:01,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:01,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:01,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:47:01,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:47:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:47:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:47:01,726 INFO L87 Difference]: Start difference. First operand 2056 states and 2969 transitions. Second operand 15 states. [2019-10-02 12:47:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:05,272 INFO L93 Difference]: Finished difference Result 3371 states and 4832 transitions. [2019-10-02 12:47:05,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:47:05,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 213 [2019-10-02 12:47:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:05,290 INFO L225 Difference]: With dead ends: 3371 [2019-10-02 12:47:05,291 INFO L226 Difference]: Without dead ends: 2174 [2019-10-02 12:47:05,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:47:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-02 12:47:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2137. [2019-10-02 12:47:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-10-02 12:47:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3106 transitions. [2019-10-02 12:47:05,435 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3106 transitions. Word has length 213 [2019-10-02 12:47:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:05,436 INFO L475 AbstractCegarLoop]: Abstraction has 2137 states and 3106 transitions. [2019-10-02 12:47:05,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:47:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3106 transitions. [2019-10-02 12:47:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:47:05,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:05,445 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:05,445 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash -455156519, now seen corresponding path program 1 times [2019-10-02 12:47:05,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:05,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:05,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:47:05,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:05,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 12:47:05,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:47:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:47:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:47:05,782 INFO L87 Difference]: Start difference. First operand 2137 states and 3106 transitions. Second operand 16 states. [2019-10-02 12:47:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:06,249 INFO L93 Difference]: Finished difference Result 3482 states and 4997 transitions. [2019-10-02 12:47:06,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:47:06,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 213 [2019-10-02 12:47:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:06,264 INFO L225 Difference]: With dead ends: 3482 [2019-10-02 12:47:06,264 INFO L226 Difference]: Without dead ends: 2184 [2019-10-02 12:47:06,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:47:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-10-02 12:47:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2182. [2019-10-02 12:47:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-10-02 12:47:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3147 transitions. [2019-10-02 12:47:06,390 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3147 transitions. Word has length 213 [2019-10-02 12:47:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:06,391 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3147 transitions. [2019-10-02 12:47:06,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:47:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3147 transitions. [2019-10-02 12:47:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:47:06,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:06,401 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:06,401 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:06,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -669130923, now seen corresponding path program 1 times [2019-10-02 12:47:06,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:06,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:06,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:06,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:06,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:06,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:47:06,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:47:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:47:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:47:06,693 INFO L87 Difference]: Start difference. First operand 2182 states and 3147 transitions. Second operand 5 states. [2019-10-02 12:47:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:07,802 INFO L93 Difference]: Finished difference Result 5250 states and 7491 transitions. [2019-10-02 12:47:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:47:07,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-02 12:47:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:07,834 INFO L225 Difference]: With dead ends: 5250 [2019-10-02 12:47:07,835 INFO L226 Difference]: Without dead ends: 4583 [2019-10-02 12:47:07,842 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:47:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-10-02 12:47:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4569. [2019-10-02 12:47:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4569 states. [2019-10-02 12:47:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 6556 transitions. [2019-10-02 12:47:08,116 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 6556 transitions. Word has length 213 [2019-10-02 12:47:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:08,117 INFO L475 AbstractCegarLoop]: Abstraction has 4569 states and 6556 transitions. [2019-10-02 12:47:08,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:47:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 6556 transitions. [2019-10-02 12:47:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:47:08,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:08,129 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:08,130 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1624652202, now seen corresponding path program 1 times [2019-10-02 12:47:08,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:08,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:08,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:47:08,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:47:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:47:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:47:08,365 INFO L87 Difference]: Start difference. First operand 4569 states and 6556 transitions. Second operand 7 states. [2019-10-02 12:47:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:10,710 INFO L93 Difference]: Finished difference Result 14668 states and 22678 transitions. [2019-10-02 12:47:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:47:10,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 213 [2019-10-02 12:47:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:10,806 INFO L225 Difference]: With dead ends: 14668 [2019-10-02 12:47:10,806 INFO L226 Difference]: Without dead ends: 11355 [2019-10-02 12:47:10,830 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 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:47:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2019-10-02 12:47:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 11349. [2019-10-02 12:47:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11349 states. [2019-10-02 12:47:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11349 states to 11349 states and 17302 transitions. [2019-10-02 12:47:12,251 INFO L78 Accepts]: Start accepts. Automaton has 11349 states and 17302 transitions. Word has length 213 [2019-10-02 12:47:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:12,255 INFO L475 AbstractCegarLoop]: Abstraction has 11349 states and 17302 transitions. [2019-10-02 12:47:12,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:47:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11349 states and 17302 transitions. [2019-10-02 12:47:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 12:47:12,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:12,271 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:12,271 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:12,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash 902999511, now seen corresponding path program 1 times [2019-10-02 12:47:12,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:12,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:12,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:12,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-02 12:47:12,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 12:47:12,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 12:47:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:47:12,783 INFO L87 Difference]: Start difference. First operand 11349 states and 17302 transitions. Second operand 28 states. [2019-10-02 12:47:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:14,093 INFO L93 Difference]: Finished difference Result 22913 states and 35757 transitions. [2019-10-02 12:47:14,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 12:47:14,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 214 [2019-10-02 12:47:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:14,178 INFO L225 Difference]: With dead ends: 22913 [2019-10-02 12:47:14,178 INFO L226 Difference]: Without dead ends: 12820 [2019-10-02 12:47:14,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:47:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12820 states. [2019-10-02 12:47:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12820 to 12799. [2019-10-02 12:47:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12799 states. [2019-10-02 12:47:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12799 states to 12799 states and 19557 transitions. [2019-10-02 12:47:15,064 INFO L78 Accepts]: Start accepts. Automaton has 12799 states and 19557 transitions. Word has length 214 [2019-10-02 12:47:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:15,065 INFO L475 AbstractCegarLoop]: Abstraction has 12799 states and 19557 transitions. [2019-10-02 12:47:15,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 12:47:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 12799 states and 19557 transitions. [2019-10-02 12:47:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:47:15,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:15,084 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:15,084 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash 338732121, now seen corresponding path program 1 times [2019-10-02 12:47:15,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:15,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:15,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:15,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:15,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:47:15,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:47:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:47:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:47:15,323 INFO L87 Difference]: Start difference. First operand 12799 states and 19557 transitions. Second operand 10 states. [2019-10-02 12:47:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:15,619 INFO L93 Difference]: Finished difference Result 12922 states and 19739 transitions. [2019-10-02 12:47:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:47:15,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2019-10-02 12:47:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:15,692 INFO L225 Difference]: With dead ends: 12922 [2019-10-02 12:47:15,692 INFO L226 Difference]: Without dead ends: 12919 [2019-10-02 12:47:15,704 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:47:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12919 states. [2019-10-02 12:47:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12919 to 12919. [2019-10-02 12:47:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12919 states. [2019-10-02 12:47:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12919 states to 12919 states and 19697 transitions. [2019-10-02 12:47:16,510 INFO L78 Accepts]: Start accepts. Automaton has 12919 states and 19697 transitions. Word has length 218 [2019-10-02 12:47:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:16,511 INFO L475 AbstractCegarLoop]: Abstraction has 12919 states and 19697 transitions. [2019-10-02 12:47:16,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:47:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 12919 states and 19697 transitions. [2019-10-02 12:47:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 12:47:16,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:16,528 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:16,528 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1284073295, now seen corresponding path program 1 times [2019-10-02 12:47:16,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:16,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:16,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:16,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:47:16,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:47:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:47:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:47:16,685 INFO L87 Difference]: Start difference. First operand 12919 states and 19697 transitions. Second operand 5 states. [2019-10-02 12:47:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:16,995 INFO L93 Difference]: Finished difference Result 24536 states and 37989 transitions. [2019-10-02 12:47:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:47:16,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-02 12:47:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:17,071 INFO L225 Difference]: With dead ends: 24536 [2019-10-02 12:47:17,071 INFO L226 Difference]: Without dead ends: 13330 [2019-10-02 12:47:17,112 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:47:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13330 states. [2019-10-02 12:47:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13330 to 13123. [2019-10-02 12:47:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13123 states. [2019-10-02 12:47:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13123 states to 13123 states and 19906 transitions. [2019-10-02 12:47:18,030 INFO L78 Accepts]: Start accepts. Automaton has 13123 states and 19906 transitions. Word has length 223 [2019-10-02 12:47:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:18,030 INFO L475 AbstractCegarLoop]: Abstraction has 13123 states and 19906 transitions. [2019-10-02 12:47:18,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:47:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 13123 states and 19906 transitions. [2019-10-02 12:47:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:47:18,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:18,046 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:18,047 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:18,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1663872811, now seen corresponding path program 1 times [2019-10-02 12:47:18,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:18,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:18,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:18,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:18,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:47:18,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:47:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:47:18,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:47:18,197 INFO L87 Difference]: Start difference. First operand 13123 states and 19906 transitions. Second operand 5 states. [2019-10-02 12:47:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:18,497 INFO L93 Difference]: Finished difference Result 22527 states and 33920 transitions. [2019-10-02 12:47:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:47:18,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-02 12:47:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:18,559 INFO L225 Difference]: With dead ends: 22527 [2019-10-02 12:47:18,559 INFO L226 Difference]: Without dead ends: 10600 [2019-10-02 12:47:18,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:47:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2019-10-02 12:47:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10590. [2019-10-02 12:47:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10590 states. [2019-10-02 12:47:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 15929 transitions. [2019-10-02 12:47:19,124 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 15929 transitions. Word has length 225 [2019-10-02 12:47:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:19,125 INFO L475 AbstractCegarLoop]: Abstraction has 10590 states and 15929 transitions. [2019-10-02 12:47:19,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:47:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 15929 transitions. [2019-10-02 12:47:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 12:47:19,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:19,142 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:19,142 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 965874213, now seen corresponding path program 1 times [2019-10-02 12:47:19,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:19,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:19,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:47:19,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:19,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:47:19,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:47:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:47:19,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:47:19,335 INFO L87 Difference]: Start difference. First operand 10590 states and 15929 transitions. Second operand 6 states. [2019-10-02 12:47:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:20,775 INFO L93 Difference]: Finished difference Result 30742 states and 47178 transitions. [2019-10-02 12:47:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:47:20,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-10-02 12:47:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:20,878 INFO L225 Difference]: With dead ends: 30742 [2019-10-02 12:47:20,879 INFO L226 Difference]: Without dead ends: 21427 [2019-10-02 12:47:20,917 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:47:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21427 states. [2019-10-02 12:47:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21427 to 21067. [2019-10-02 12:47:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21067 states. [2019-10-02 12:47:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21067 states to 21067 states and 31816 transitions. [2019-10-02 12:47:21,985 INFO L78 Accepts]: Start accepts. Automaton has 21067 states and 31816 transitions. Word has length 224 [2019-10-02 12:47:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:21,986 INFO L475 AbstractCegarLoop]: Abstraction has 21067 states and 31816 transitions. [2019-10-02 12:47:21,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:47:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 21067 states and 31816 transitions. [2019-10-02 12:47:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 12:47:22,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:22,018 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2083182830, now seen corresponding path program 1 times [2019-10-02 12:47:22,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:22,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:22,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:22,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:47:22,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:22,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:47:22,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:47:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:47:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:47:22,166 INFO L87 Difference]: Start difference. First operand 21067 states and 31816 transitions. Second operand 3 states. [2019-10-02 12:47:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:22,675 INFO L93 Difference]: Finished difference Result 43059 states and 65461 transitions. [2019-10-02 12:47:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:47:22,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-02 12:47:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:22,782 INFO L225 Difference]: With dead ends: 43059 [2019-10-02 12:47:22,782 INFO L226 Difference]: Without dead ends: 22057 [2019-10-02 12:47:22,841 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:47:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22057 states. [2019-10-02 12:47:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22057 to 22051. [2019-10-02 12:47:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-10-02 12:47:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 33688 transitions. [2019-10-02 12:47:24,012 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 33688 transitions. Word has length 244 [2019-10-02 12:47:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:24,013 INFO L475 AbstractCegarLoop]: Abstraction has 22051 states and 33688 transitions. [2019-10-02 12:47:24,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:47:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 33688 transitions. [2019-10-02 12:47:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 12:47:24,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:24,043 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:24,043 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1522240526, now seen corresponding path program 1 times [2019-10-02 12:47:24,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:24,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:24,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:47:24,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:47:24,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:47:24,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:47:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:47:24,252 INFO L87 Difference]: Start difference. First operand 22051 states and 33688 transitions. Second operand 8 states. [2019-10-02 12:47:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:30,797 INFO L93 Difference]: Finished difference Result 66767 states and 104794 transitions. [2019-10-02 12:47:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:47:30,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 260 [2019-10-02 12:47:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:30,962 INFO L225 Difference]: With dead ends: 66767 [2019-10-02 12:47:30,962 INFO L226 Difference]: Without dead ends: 44781 [2019-10-02 12:47:31,016 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:47:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44781 states. [2019-10-02 12:47:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44781 to 25777. [2019-10-02 12:47:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25777 states. [2019-10-02 12:47:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25777 states to 25777 states and 41512 transitions. [2019-10-02 12:47:32,442 INFO L78 Accepts]: Start accepts. Automaton has 25777 states and 41512 transitions. Word has length 260 [2019-10-02 12:47:32,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:32,442 INFO L475 AbstractCegarLoop]: Abstraction has 25777 states and 41512 transitions. [2019-10-02 12:47:32,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:47:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 25777 states and 41512 transitions. [2019-10-02 12:47:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 12:47:32,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:32,470 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:32,470 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash -332003897, now seen corresponding path program 1 times [2019-10-02 12:47:32,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:32,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:32,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:32,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:47:32,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:32,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:47:32,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:47:32,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:47:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:47:32,717 INFO L87 Difference]: Start difference. First operand 25777 states and 41512 transitions. Second operand 8 states. [2019-10-02 12:47:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:40,850 INFO L93 Difference]: Finished difference Result 78749 states and 132310 transitions. [2019-10-02 12:47:40,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:47:40,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 261 [2019-10-02 12:47:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:41,188 INFO L225 Difference]: With dead ends: 78749 [2019-10-02 12:47:41,189 INFO L226 Difference]: Without dead ends: 53037 [2019-10-02 12:47:41,305 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:47:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53037 states. [2019-10-02 12:47:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53037 to 33409. [2019-10-02 12:47:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33409 states. [2019-10-02 12:47:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33409 states to 33409 states and 58756 transitions. [2019-10-02 12:47:43,317 INFO L78 Accepts]: Start accepts. Automaton has 33409 states and 58756 transitions. Word has length 261 [2019-10-02 12:47:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:43,317 INFO L475 AbstractCegarLoop]: Abstraction has 33409 states and 58756 transitions. [2019-10-02 12:47:43,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:47:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 33409 states and 58756 transitions. [2019-10-02 12:47:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:47:43,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:43,410 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:43,411 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1676298254, now seen corresponding path program 1 times [2019-10-02 12:47:43,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:43,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:43,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:47:43,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:43,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:47:43,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:47:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:47:43,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:47:43,627 INFO L87 Difference]: Start difference. First operand 33409 states and 58756 transitions. Second operand 8 states. [2019-10-02 12:47:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:51,453 INFO L93 Difference]: Finished difference Result 103121 states and 192064 transitions. [2019-10-02 12:47:51,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:47:51,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 262 [2019-10-02 12:47:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:51,833 INFO L225 Difference]: With dead ends: 103121 [2019-10-02 12:47:51,833 INFO L226 Difference]: Without dead ends: 69777 [2019-10-02 12:47:51,943 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:47:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69777 states. [2019-10-02 12:47:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69777 to 48865. [2019-10-02 12:47:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48865 states. [2019-10-02 12:47:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48865 states to 48865 states and 96226 transitions. [2019-10-02 12:47:54,746 INFO L78 Accepts]: Start accepts. Automaton has 48865 states and 96226 transitions. Word has length 262 [2019-10-02 12:47:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:54,747 INFO L475 AbstractCegarLoop]: Abstraction has 48865 states and 96226 transitions. [2019-10-02 12:47:54,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:47:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 48865 states and 96226 transitions. [2019-10-02 12:47:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 12:47:54,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:54,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:54,899 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash 313851400, now seen corresponding path program 1 times [2019-10-02 12:47:54,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:54,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:47:55,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:47:55,123 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:47:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:55,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 3025 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:47:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:47:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:47:56,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:47:56,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 12:47:56,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:47:56,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:47:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:47:56,017 INFO L87 Difference]: Start difference. First operand 48865 states and 96226 transitions. Second operand 13 states. [2019-10-02 12:48:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:01,979 INFO L93 Difference]: Finished difference Result 102904 states and 200929 transitions. [2019-10-02 12:48:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:48:01,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 243 [2019-10-02 12:48:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:02,490 INFO L225 Difference]: With dead ends: 102904 [2019-10-02 12:48:02,490 INFO L226 Difference]: Without dead ends: 54065 [2019-10-02 12:48:03,108 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:48:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-10-02 12:48:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 53812. [2019-10-02 12:48:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53812 states. [2019-10-02 12:48:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53812 states to 53812 states and 103043 transitions. [2019-10-02 12:48:08,187 INFO L78 Accepts]: Start accepts. Automaton has 53812 states and 103043 transitions. Word has length 243 [2019-10-02 12:48:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:08,188 INFO L475 AbstractCegarLoop]: Abstraction has 53812 states and 103043 transitions. [2019-10-02 12:48:08,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:48:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53812 states and 103043 transitions. [2019-10-02 12:48:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 12:48:08,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:08,615 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:08,616 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash -710189863, now seen corresponding path program 1 times [2019-10-02 12:48:08,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:08,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:08,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:08,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:48:08,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:08,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:48:08,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:48:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:48:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:48:08,800 INFO L87 Difference]: Start difference. First operand 53812 states and 103043 transitions. Second operand 3 states. [2019-10-02 12:48:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:12,780 INFO L93 Difference]: Finished difference Result 122719 states and 246513 transitions. [2019-10-02 12:48:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:48:12,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-10-02 12:48:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:13,312 INFO L225 Difference]: With dead ends: 122719 [2019-10-02 12:48:13,313 INFO L226 Difference]: Without dead ends: 68986 [2019-10-02 12:48:13,523 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:48:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68986 states. [2019-10-02 12:48:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68986 to 68980. [2019-10-02 12:48:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68980 states. [2019-10-02 12:48:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68980 states to 68980 states and 143171 transitions. [2019-10-02 12:48:17,241 INFO L78 Accepts]: Start accepts. Automaton has 68980 states and 143171 transitions. Word has length 268 [2019-10-02 12:48:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:17,242 INFO L475 AbstractCegarLoop]: Abstraction has 68980 states and 143171 transitions. [2019-10-02 12:48:17,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:48:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 68980 states and 143171 transitions. [2019-10-02 12:48:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 12:48:17,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:17,490 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:17,490 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash -790084860, now seen corresponding path program 1 times [2019-10-02 12:48:17,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:48:17,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:17,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:48:17,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:48:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:48:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:48:17,701 INFO L87 Difference]: Start difference. First operand 68980 states and 143171 transitions. Second operand 6 states. [2019-10-02 12:48:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:24,289 INFO L93 Difference]: Finished difference Result 162218 states and 325226 transitions. [2019-10-02 12:48:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:48:24,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2019-10-02 12:48:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:25,262 INFO L225 Difference]: With dead ends: 162218 [2019-10-02 12:48:25,263 INFO L226 Difference]: Without dead ends: 138691 [2019-10-02 12:48:25,367 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:48:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138691 states. [2019-10-02 12:48:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138691 to 138440. [2019-10-02 12:48:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138440 states. [2019-10-02 12:48:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138440 states to 138440 states and 287262 transitions. [2019-10-02 12:48:36,408 INFO L78 Accepts]: Start accepts. Automaton has 138440 states and 287262 transitions. Word has length 269 [2019-10-02 12:48:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:36,408 INFO L475 AbstractCegarLoop]: Abstraction has 138440 states and 287262 transitions. [2019-10-02 12:48:36,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:48:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 138440 states and 287262 transitions. [2019-10-02 12:48:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 12:48:36,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:36,931 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:36,931 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1792816759, now seen corresponding path program 1 times [2019-10-02 12:48:36,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:36,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:36,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:48:37,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:37,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 12:48:37,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 12:48:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 12:48:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-10-02 12:48:37,353 INFO L87 Difference]: Start difference. First operand 138440 states and 287262 transitions. Second operand 21 states. [2019-10-02 12:48:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:51,579 INFO L93 Difference]: Finished difference Result 205448 states and 414589 transitions. [2019-10-02 12:48:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 12:48:51,580 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 269 [2019-10-02 12:48:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:53,034 INFO L225 Difference]: With dead ends: 205448 [2019-10-02 12:48:53,035 INFO L226 Difference]: Without dead ends: 194567 [2019-10-02 12:48:53,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=2518, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 12:48:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194567 states. [2019-10-02 12:49:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194567 to 193975. [2019-10-02 12:49:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193975 states. [2019-10-02 12:49:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193975 states to 193975 states and 397203 transitions. [2019-10-02 12:49:11,985 INFO L78 Accepts]: Start accepts. Automaton has 193975 states and 397203 transitions. Word has length 269 [2019-10-02 12:49:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:11,986 INFO L475 AbstractCegarLoop]: Abstraction has 193975 states and 397203 transitions. [2019-10-02 12:49:11,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 12:49:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 193975 states and 397203 transitions. [2019-10-02 12:49:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 12:49:12,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:12,736 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:12,736 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2107917906, now seen corresponding path program 1 times [2019-10-02 12:49:12,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:12,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:12,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:49:12,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:12,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:49:12,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:49:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:49:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:49:12,925 INFO L87 Difference]: Start difference. First operand 193975 states and 397203 transitions. Second operand 7 states. [2019-10-02 12:49:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:34,419 INFO L93 Difference]: Finished difference Result 423517 states and 981968 transitions. [2019-10-02 12:49:34,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:49:34,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 270 [2019-10-02 12:49:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:36,517 INFO L225 Difference]: With dead ends: 423517 [2019-10-02 12:49:36,517 INFO L226 Difference]: Without dead ends: 390990 [2019-10-02 12:49:36,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:49:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390990 states. [2019-10-02 12:50:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390990 to 377003. [2019-10-02 12:50:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377003 states. [2019-10-02 12:50:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377003 states to 377003 states and 909493 transitions. [2019-10-02 12:50:30,330 INFO L78 Accepts]: Start accepts. Automaton has 377003 states and 909493 transitions. Word has length 270 [2019-10-02 12:50:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:50:30,331 INFO L475 AbstractCegarLoop]: Abstraction has 377003 states and 909493 transitions. [2019-10-02 12:50:30,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:50:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 377003 states and 909493 transitions. [2019-10-02 12:50:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 12:50:32,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:50:32,122 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:50:32,122 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:50:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:50:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -292080536, now seen corresponding path program 1 times [2019-10-02 12:50:32,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:50:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:50:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:32,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:50:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:50:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:50:33,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:50:33,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:50:33,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:50:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:50:33,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:50:33,834 INFO L87 Difference]: Start difference. First operand 377003 states and 909493 transitions. Second operand 11 states. [2019-10-02 12:51:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:00,444 INFO L93 Difference]: Finished difference Result 526096 states and 1144689 transitions. [2019-10-02 12:51:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:51:00,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 272 [2019-10-02 12:51:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:03,296 INFO L225 Difference]: With dead ends: 526096 [2019-10-02 12:51:03,296 INFO L226 Difference]: Without dead ends: 399554 [2019-10-02 12:51:03,713 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:51:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399554 states. [2019-10-02 12:51:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399554 to 392775. [2019-10-02 12:51:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392775 states. [2019-10-02 12:51:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392775 states to 392775 states and 936024 transitions. [2019-10-02 12:51:54,538 INFO L78 Accepts]: Start accepts. Automaton has 392775 states and 936024 transitions. Word has length 272 [2019-10-02 12:51:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:54,539 INFO L475 AbstractCegarLoop]: Abstraction has 392775 states and 936024 transitions. [2019-10-02 12:51:54,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:51:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 392775 states and 936024 transitions. [2019-10-02 12:52:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 12:52:09,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:09,374 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:52:09,374 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1810243553, now seen corresponding path program 1 times [2019-10-02 12:52:09,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:09,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 12:52:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:52:09,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:52:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:52:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:52:09,549 INFO L87 Difference]: Start difference. First operand 392775 states and 936024 transitions. Second operand 6 states. [2019-10-02 12:53:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:04,177 INFO L93 Difference]: Finished difference Result 931016 states and 2103448 transitions. [2019-10-02 12:53:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:53:04,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 274 [2019-10-02 12:53:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:10,137 INFO L225 Difference]: With dead ends: 931016 [2019-10-02 12:53:10,137 INFO L226 Difference]: Without dead ends: 788935 [2019-10-02 12:53:10,716 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:53:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788935 states.