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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:37:20,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:37:20,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:37:20,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:37:20,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:37:20,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:37:20,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:37:20,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:37:20,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:37:20,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:37:20,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:37:20,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:37:20,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:37:20,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:37:20,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:37:20,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:37:20,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:37:20,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:37:20,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:37:20,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:37:20,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:37:20,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:37:20,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:37:20,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:37:20,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:37:20,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:37:20,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:37:20,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:37:20,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:37:20,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:37:20,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:37:20,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:37:20,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:37:20,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:37:20,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:37:20,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:37:20,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:37:20,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:37:20,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:37:20,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:37:20,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:37:20,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:37:20,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:37:20,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:37:20,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:37:20,999 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:37:21,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:37:21,000 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:37:21,001 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:37:21,001 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:37:21,001 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:37:21,001 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:37:21,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:37:21,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:37:21,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:37:21,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:37:21,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:37:21,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:37:21,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:37:21,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:37:21,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:37:21,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:37:21,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:37:21,004 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:37:21,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:37:21,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:37:21,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:37:21,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:37:21,005 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:37:21,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:37:21,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:37:21,006 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:37:21,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:37:21,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:37:21,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:37:21,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:37:21,051 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:37:21,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-09-10 02:37:21,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e5f4652/3cde93f8fd3843c78e0a95125beeef28/FLAG346f672ae [2019-09-10 02:37:21,690 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:37:21,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product26.cil.c [2019-09-10 02:37:21,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e5f4652/3cde93f8fd3843c78e0a95125beeef28/FLAG346f672ae [2019-09-10 02:37:21,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e5f4652/3cde93f8fd3843c78e0a95125beeef28 [2019-09-10 02:37:21,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:37:21,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:37:21,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:37:21,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:37:21,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:37:21,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:37:21" (1/1) ... [2019-09-10 02:37:21,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272c4be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:21, skipping insertion in model container [2019-09-10 02:37:21,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:37:21" (1/1) ... [2019-09-10 02:37:21,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:37:21,966 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:37:22,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:37:22,846 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:37:23,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:37:23,230 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:37:23,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23 WrapperNode [2019-09-10 02:37:23,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:37:23,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:37:23,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:37:23,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:37:23,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... [2019-09-10 02:37:23,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:37:23,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:37:23,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:37:23,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:37:23,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:37:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:37:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:37:23,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:37:23,527 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:37:23,527 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:37:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:37:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:37:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:37:23,529 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:37:23,529 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-10 02:37:23,529 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-10 02:37:23,529 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:37:23,529 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:37:23,530 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:37:23,531 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:37:23,532 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:37:23,532 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:37:23,532 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:37:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:37:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:37:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:37:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:37:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-10 02:37:23,535 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:37:23,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:37:23,536 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:37:23,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:37:23,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:37:23,537 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:37:23,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:37:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:37:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:37:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:37:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:37:23,538 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:37:23,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:37:23,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:37:23,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:37:23,540 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:37:23,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:37:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:37:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:37:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:37:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:37:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:37:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:37:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:37:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:37:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:37:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:37:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:37:23,545 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:37:23,545 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:37:23,545 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:37:23,545 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:37:23,545 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:37:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-10 02:37:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:37:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:37:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:37:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:37:23,547 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:37:23,547 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:37:23,547 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:37:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:37:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:37:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:37:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:37:23,549 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:37:23,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:37:23,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:37:23,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:37:23,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:37:23,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:37:23,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:37:23,551 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:37:23,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:37:23,552 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:37:23,553 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:37:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:37:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:37:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:37:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:37:23,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:37:23,555 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:37:23,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:37:23,555 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:37:23,555 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:37:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:37:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:37:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:37:23,556 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:37:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:37:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:37:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:37:23,557 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:37:23,558 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:37:23,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:37:23,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:37:23,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:37:23,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:37:23,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:37:23,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:37:23,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:37:23,560 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:37:23,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:37:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:37:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:37:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:37:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:37:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:37:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:37:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:37:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:37:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:37:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:37:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:37:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:37:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:37:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:37:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:37:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:37:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:37:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:37:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:37:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:37:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:37:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:37:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:37:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:37:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:37:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:37:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:37:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:37:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:37:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:37:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:37:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:37:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:37:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:37:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:37:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-10 02:37:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-10 02:37:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-10 02:37:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:37:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:37:23,586 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:37:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:37:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:37:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:37:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:37:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:37:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:37:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:37:23,589 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:37:23,590 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:37:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:37:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:37:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:37:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:37:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:37:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:37:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:37:23,593 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:37:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:37:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:37:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:37:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:37:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:37:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:37:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:37:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:37:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:37:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:37:23,596 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:37:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:37:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:37:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:37:23,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:37:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:37:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:37:23,598 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:37:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:37:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:37:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:37:23,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:37:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:37:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:37:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:37:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:37:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:37:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:37:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:37:25,968 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:37:25,969 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:37:25,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:37:25 BoogieIcfgContainer [2019-09-10 02:37:25,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:37:25,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:37:25,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:37:25,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:37:25,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:37:21" (1/3) ... [2019-09-10 02:37:25,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41247464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:37:25, skipping insertion in model container [2019-09-10 02:37:25,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:37:23" (2/3) ... [2019-09-10 02:37:25,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41247464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:37:25, skipping insertion in model container [2019-09-10 02:37:25,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:37:25" (3/3) ... [2019-09-10 02:37:25,981 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product26.cil.c [2019-09-10 02:37:25,994 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:37:26,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:37:26,023 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:37:26,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:37:26,052 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:37:26,053 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:37:26,053 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:37:26,053 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:37:26,053 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:37:26,053 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:37:26,053 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:37:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states. [2019-09-10 02:37:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:37:26,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:26,135 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:26,140 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1050293999, now seen corresponding path program 1 times [2019-09-10 02:37:26,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:26,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:26,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:26,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:26,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:37:26,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:27,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:37:27,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:37:27,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:37:27,018 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 2 states. [2019-09-10 02:37:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:27,075 INFO L93 Difference]: Finished difference Result 578 states and 786 transitions. [2019-09-10 02:37:27,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:37:27,077 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 209 [2019-09-10 02:37:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:27,100 INFO L225 Difference]: With dead ends: 578 [2019-09-10 02:37:27,100 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 02:37:27,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:37:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 02:37:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-09-10 02:37:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-10 02:37:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 775 transitions. [2019-09-10 02:37:27,200 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 775 transitions. Word has length 209 [2019-09-10 02:37:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:27,202 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 775 transitions. [2019-09-10 02:37:27,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:37:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2019-09-10 02:37:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:37:27,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:27,209 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:27,209 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:27,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1566712798, now seen corresponding path program 1 times [2019-09-10 02:37:27,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:27,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:27,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:27,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:27,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:27,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:27,435 INFO L87 Difference]: Start difference. First operand 569 states and 775 transitions. Second operand 3 states. [2019-09-10 02:37:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:27,499 INFO L93 Difference]: Finished difference Result 572 states and 778 transitions. [2019-09-10 02:37:27,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:27,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-10 02:37:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:27,513 INFO L225 Difference]: With dead ends: 572 [2019-09-10 02:37:27,513 INFO L226 Difference]: Without dead ends: 572 [2019-09-10 02:37:27,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-10 02:37:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 571. [2019-09-10 02:37:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:37:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 777 transitions. [2019-09-10 02:37:27,568 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 777 transitions. Word has length 210 [2019-09-10 02:37:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:27,568 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 777 transitions. [2019-09-10 02:37:27,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 777 transitions. [2019-09-10 02:37:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-10 02:37:27,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:27,574 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:27,574 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:27,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:27,575 INFO L82 PathProgramCache]: Analyzing trace with hash 641729421, now seen corresponding path program 1 times [2019-09-10 02:37:27,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:27,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:27,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:27,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:27,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:27,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:27,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:27,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:27,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:27,830 INFO L87 Difference]: Start difference. First operand 571 states and 777 transitions. Second operand 3 states. [2019-09-10 02:37:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:27,873 INFO L93 Difference]: Finished difference Result 616 states and 853 transitions. [2019-09-10 02:37:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:27,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-10 02:37:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:27,884 INFO L225 Difference]: With dead ends: 616 [2019-09-10 02:37:27,884 INFO L226 Difference]: Without dead ends: 616 [2019-09-10 02:37:27,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-10 02:37:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2019-09-10 02:37:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-10 02:37:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 852 transitions. [2019-09-10 02:37:27,924 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 852 transitions. Word has length 222 [2019-09-10 02:37:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:27,925 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 852 transitions. [2019-09-10 02:37:27,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 852 transitions. [2019-09-10 02:37:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 02:37:27,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:27,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:27,936 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1183894692, now seen corresponding path program 1 times [2019-09-10 02:37:27,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:27,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:27,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:28,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:28,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:28,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:28,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:28,144 INFO L87 Difference]: Start difference. First operand 615 states and 852 transitions. Second operand 3 states. [2019-09-10 02:37:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:28,191 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2019-09-10 02:37:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:28,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-09-10 02:37:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:28,201 INFO L225 Difference]: With dead ends: 701 [2019-09-10 02:37:28,201 INFO L226 Difference]: Without dead ends: 701 [2019-09-10 02:37:28,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-09-10 02:37:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2019-09-10 02:37:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-10 02:37:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 996 transitions. [2019-09-10 02:37:28,248 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 996 transitions. Word has length 223 [2019-09-10 02:37:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:28,251 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 996 transitions. [2019-09-10 02:37:28,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 996 transitions. [2019-09-10 02:37:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 02:37:28,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:28,266 INFO L399 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] [2019-09-10 02:37:28,266 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash -577752831, now seen corresponding path program 1 times [2019-09-10 02:37:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:28,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:29,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:29,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:37:29,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:29,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:37:29,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:37:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:37:29,155 INFO L87 Difference]: Start difference. First operand 700 states and 996 transitions. Second operand 19 states. [2019-09-10 02:37:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:35,505 INFO L93 Difference]: Finished difference Result 1971 states and 2820 transitions. [2019-09-10 02:37:35,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:37:35,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-09-10 02:37:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:35,523 INFO L225 Difference]: With dead ends: 1971 [2019-09-10 02:37:35,523 INFO L226 Difference]: Without dead ends: 1971 [2019-09-10 02:37:35,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:37:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-09-10 02:37:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1934. [2019-09-10 02:37:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-09-10 02:37:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2772 transitions. [2019-09-10 02:37:35,700 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2772 transitions. Word has length 226 [2019-09-10 02:37:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:35,701 INFO L475 AbstractCegarLoop]: Abstraction has 1934 states and 2772 transitions. [2019-09-10 02:37:35,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:37:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2772 transitions. [2019-09-10 02:37:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:37:35,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:35,710 INFO L399 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] [2019-09-10 02:37:35,711 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 893920590, now seen corresponding path program 1 times [2019-09-10 02:37:35,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:35,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:35,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:35,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:35,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:35,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:35,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:37:35,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:35,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:37:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:37:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:37:35,973 INFO L87 Difference]: Start difference. First operand 1934 states and 2772 transitions. Second operand 11 states. [2019-09-10 02:37:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:36,504 INFO L93 Difference]: Finished difference Result 2064 states and 2987 transitions. [2019-09-10 02:37:36,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:36,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2019-09-10 02:37:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:36,518 INFO L225 Difference]: With dead ends: 2064 [2019-09-10 02:37:36,518 INFO L226 Difference]: Without dead ends: 2056 [2019-09-10 02:37:36,519 INFO L628 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-09-10 02:37:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-09-10 02:37:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2056. [2019-09-10 02:37:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-10 02:37:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2969 transitions. [2019-09-10 02:37:36,601 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2969 transitions. Word has length 227 [2019-09-10 02:37:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:36,601 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2969 transitions. [2019-09-10 02:37:36,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:37:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2969 transitions. [2019-09-10 02:37:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:37:36,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:36,611 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:36,611 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1553480520, now seen corresponding path program 1 times [2019-09-10 02:37:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:36,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:36,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:37:36,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 02:37:36,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:36,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:37:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:37:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:37:36,946 INFO L87 Difference]: Start difference. First operand 2056 states and 2969 transitions. Second operand 16 states. [2019-09-10 02:37:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:37,529 INFO L93 Difference]: Finished difference Result 2112 states and 3034 transitions. [2019-09-10 02:37:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:37:37,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 227 [2019-09-10 02:37:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:37,543 INFO L225 Difference]: With dead ends: 2112 [2019-09-10 02:37:37,544 INFO L226 Difference]: Without dead ends: 2112 [2019-09-10 02:37:37,544 INFO L628 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-09-10 02:37:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2019-09-10 02:37:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2019-09-10 02:37:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-09-10 02:37:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 3034 transitions. [2019-09-10 02:37:37,626 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 3034 transitions. Word has length 227 [2019-09-10 02:37:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:37,627 INFO L475 AbstractCegarLoop]: Abstraction has 2112 states and 3034 transitions. [2019-09-10 02:37:37,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:37:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3034 transitions. [2019-09-10 02:37:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:37:37,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:37,637 INFO L399 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] [2019-09-10 02:37:37,638 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1022222007, now seen corresponding path program 1 times [2019-09-10 02:37:37,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:37,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:37:37,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:37,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:37:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:37:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:37,944 INFO L87 Difference]: Start difference. First operand 2112 states and 3034 transitions. Second operand 15 states. [2019-09-10 02:37:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:42,436 INFO L93 Difference]: Finished difference Result 2214 states and 3182 transitions. [2019-09-10 02:37:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:37:42,437 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 227 [2019-09-10 02:37:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:42,453 INFO L225 Difference]: With dead ends: 2214 [2019-09-10 02:37:42,454 INFO L226 Difference]: Without dead ends: 2214 [2019-09-10 02:37:42,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:37:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-09-10 02:37:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2182. [2019-09-10 02:37:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2019-09-10 02:37:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3147 transitions. [2019-09-10 02:37:42,549 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3147 transitions. Word has length 227 [2019-09-10 02:37:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:42,550 INFO L475 AbstractCegarLoop]: Abstraction has 2182 states and 3147 transitions. [2019-09-10 02:37:42,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:37:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3147 transitions. [2019-09-10 02:37:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:37:42,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:42,561 INFO L399 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] [2019-09-10 02:37:42,561 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1111356124, now seen corresponding path program 1 times [2019-09-10 02:37:42,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:42,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:42,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:42,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:42,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:42,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:42,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:37:42,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:42,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:37:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:37:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:37:42,869 INFO L87 Difference]: Start difference. First operand 2182 states and 3147 transitions. Second operand 5 states. [2019-09-10 02:37:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:44,347 INFO L93 Difference]: Finished difference Result 4583 states and 6570 transitions. [2019-09-10 02:37:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:37:44,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2019-09-10 02:37:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:44,382 INFO L225 Difference]: With dead ends: 4583 [2019-09-10 02:37:44,382 INFO L226 Difference]: Without dead ends: 4583 [2019-09-10 02:37:44,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:37:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-09-10 02:37:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4569. [2019-09-10 02:37:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4569 states. [2019-09-10 02:37:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 6556 transitions. [2019-09-10 02:37:44,549 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 6556 transitions. Word has length 227 [2019-09-10 02:37:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:44,549 INFO L475 AbstractCegarLoop]: Abstraction has 4569 states and 6556 transitions. [2019-09-10 02:37:44,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:37:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 6556 transitions. [2019-09-10 02:37:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 02:37:44,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:44,563 INFO L399 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] [2019-09-10 02:37:44,564 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1329265635, now seen corresponding path program 1 times [2019-09-10 02:37:44,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:44,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:44,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:44,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:44,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:44,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:37:44,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:44,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:37:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:37:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:37:44,919 INFO L87 Difference]: Start difference. First operand 4569 states and 6556 transitions. Second operand 13 states. [2019-09-10 02:37:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:48,961 INFO L93 Difference]: Finished difference Result 9209 states and 13201 transitions. [2019-09-10 02:37:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:37:48,962 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 227 [2019-09-10 02:37:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:49,023 INFO L225 Difference]: With dead ends: 9209 [2019-09-10 02:37:49,024 INFO L226 Difference]: Without dead ends: 9209 [2019-09-10 02:37:49,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:37:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9209 states. [2019-09-10 02:37:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9209 to 9166. [2019-09-10 02:37:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9166 states. [2019-09-10 02:37:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9166 states to 9166 states and 13139 transitions. [2019-09-10 02:37:49,388 INFO L78 Accepts]: Start accepts. Automaton has 9166 states and 13139 transitions. Word has length 227 [2019-09-10 02:37:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:49,391 INFO L475 AbstractCegarLoop]: Abstraction has 9166 states and 13139 transitions. [2019-09-10 02:37:49,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:37:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9166 states and 13139 transitions. [2019-09-10 02:37:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 02:37:49,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:49,494 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:49,495 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash 423873233, now seen corresponding path program 1 times [2019-09-10 02:37:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:49,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:49,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:37:49,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:49,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:49,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:49,644 INFO L87 Difference]: Start difference. First operand 9166 states and 13139 transitions. Second operand 3 states. [2019-09-10 02:37:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:49,700 INFO L93 Difference]: Finished difference Result 10156 states and 14915 transitions. [2019-09-10 02:37:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:37:49,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 02:37:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:49,776 INFO L225 Difference]: With dead ends: 10156 [2019-09-10 02:37:49,776 INFO L226 Difference]: Without dead ends: 10156 [2019-09-10 02:37:49,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2019-09-10 02:37:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 10150. [2019-09-10 02:37:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10150 states. [2019-09-10 02:37:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10150 states to 10150 states and 14909 transitions. [2019-09-10 02:37:50,101 INFO L78 Accepts]: Start accepts. Automaton has 10150 states and 14909 transitions. Word has length 225 [2019-09-10 02:37:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:50,101 INFO L475 AbstractCegarLoop]: Abstraction has 10150 states and 14909 transitions. [2019-09-10 02:37:50,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 10150 states and 14909 transitions. [2019-09-10 02:37:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 02:37:50,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:50,132 INFO L399 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] [2019-09-10 02:37:50,132 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1720613858, now seen corresponding path program 1 times [2019-09-10 02:37:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:50,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:50,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:37:50,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:50,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:37:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:37:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:37:50,370 INFO L87 Difference]: Start difference. First operand 10150 states and 14909 transitions. Second operand 11 states. [2019-09-10 02:37:50,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:50,641 INFO L93 Difference]: Finished difference Result 10870 states and 16054 transitions. [2019-09-10 02:37:50,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:50,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2019-09-10 02:37:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:50,684 INFO L225 Difference]: With dead ends: 10870 [2019-09-10 02:37:50,684 INFO L226 Difference]: Without dead ends: 10870 [2019-09-10 02:37:50,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:37:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10870 states. [2019-09-10 02:37:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10870 to 10790. [2019-09-10 02:37:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10790 states. [2019-09-10 02:37:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10790 states to 10790 states and 15954 transitions. [2019-09-10 02:37:51,072 INFO L78 Accepts]: Start accepts. Automaton has 10790 states and 15954 transitions. Word has length 228 [2019-09-10 02:37:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:51,075 INFO L475 AbstractCegarLoop]: Abstraction has 10790 states and 15954 transitions. [2019-09-10 02:37:51,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:37:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 10790 states and 15954 transitions. [2019-09-10 02:37:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 02:37:51,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:51,105 INFO L399 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] [2019-09-10 02:37:51,105 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1999732818, now seen corresponding path program 1 times [2019-09-10 02:37:51,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:51,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:51,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:51,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:51,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:51,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:51,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:51,300 INFO L87 Difference]: Start difference. First operand 10790 states and 15954 transitions. Second operand 9 states. [2019-09-10 02:37:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:51,514 INFO L93 Difference]: Finished difference Result 10910 states and 16094 transitions. [2019-09-10 02:37:51,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:51,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2019-09-10 02:37:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:51,559 INFO L225 Difference]: With dead ends: 10910 [2019-09-10 02:37:51,559 INFO L226 Difference]: Without dead ends: 10910 [2019-09-10 02:37:51,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:37:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10910 states. [2019-09-10 02:37:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10910 to 10830. [2019-09-10 02:37:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10830 states. [2019-09-10 02:37:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10830 states to 10830 states and 15994 transitions. [2019-09-10 02:37:51,912 INFO L78 Accepts]: Start accepts. Automaton has 10830 states and 15994 transitions. Word has length 229 [2019-09-10 02:37:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:51,913 INFO L475 AbstractCegarLoop]: Abstraction has 10830 states and 15994 transitions. [2019-09-10 02:37:51,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 10830 states and 15994 transitions. [2019-09-10 02:37:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-10 02:37:51,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:51,948 INFO L399 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] [2019-09-10 02:37:51,949 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash 41914732, now seen corresponding path program 1 times [2019-09-10 02:37:51,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:51,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:51,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:52,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:52,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:52,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:52,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:52,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:52,155 INFO L87 Difference]: Start difference. First operand 10830 states and 15994 transitions. Second operand 6 states. [2019-09-10 02:37:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:53,315 INFO L93 Difference]: Finished difference Result 21875 states and 32409 transitions. [2019-09-10 02:37:53,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:53,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-09-10 02:37:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:53,395 INFO L225 Difference]: With dead ends: 21875 [2019-09-10 02:37:53,396 INFO L226 Difference]: Without dead ends: 21875 [2019-09-10 02:37:53,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21875 states. [2019-09-10 02:37:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21875 to 21732. [2019-09-10 02:37:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21732 states. [2019-09-10 02:37:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21732 states to 21732 states and 32127 transitions. [2019-09-10 02:37:54,010 INFO L78 Accepts]: Start accepts. Automaton has 21732 states and 32127 transitions. Word has length 228 [2019-09-10 02:37:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:54,011 INFO L475 AbstractCegarLoop]: Abstraction has 21732 states and 32127 transitions. [2019-09-10 02:37:54,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 21732 states and 32127 transitions. [2019-09-10 02:37:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 02:37:54,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:54,049 INFO L399 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] [2019-09-10 02:37:54,049 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1101915101, now seen corresponding path program 1 times [2019-09-10 02:37:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:54,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:54,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:54,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:54,515 INFO L87 Difference]: Start difference. First operand 21732 states and 32127 transitions. Second operand 6 states. [2019-09-10 02:37:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:55,753 INFO L93 Difference]: Finished difference Result 44039 states and 65289 transitions. [2019-09-10 02:37:55,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:37:55,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2019-09-10 02:37:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:55,941 INFO L225 Difference]: With dead ends: 44039 [2019-09-10 02:37:55,942 INFO L226 Difference]: Without dead ends: 44039 [2019-09-10 02:37:55,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2019-09-10 02:37:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 43516. [2019-09-10 02:37:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43516 states. [2019-09-10 02:37:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43516 states to 43516 states and 64427 transitions. [2019-09-10 02:37:57,449 INFO L78 Accepts]: Start accepts. Automaton has 43516 states and 64427 transitions. Word has length 230 [2019-09-10 02:37:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:57,450 INFO L475 AbstractCegarLoop]: Abstraction has 43516 states and 64427 transitions. [2019-09-10 02:37:57,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 43516 states and 64427 transitions. [2019-09-10 02:37:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 02:37:57,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:57,526 INFO L399 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] [2019-09-10 02:37:57,527 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1811776438, now seen corresponding path program 1 times [2019-09-10 02:37:57,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:57,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:37:57,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:57,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:57,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:57,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:57,747 INFO L87 Difference]: Start difference. First operand 43516 states and 64427 transitions. Second operand 9 states. [2019-09-10 02:37:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:58,123 INFO L93 Difference]: Finished difference Result 45596 states and 67807 transitions. [2019-09-10 02:37:58,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:58,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2019-09-10 02:37:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:58,296 INFO L225 Difference]: With dead ends: 45596 [2019-09-10 02:37:58,297 INFO L226 Difference]: Without dead ends: 45596 [2019-09-10 02:37:58,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:37:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45596 states. [2019-09-10 02:38:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45596 to 45436. [2019-09-10 02:38:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45436 states. [2019-09-10 02:38:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45436 states to 45436 states and 67567 transitions. [2019-09-10 02:38:00,768 INFO L78 Accepts]: Start accepts. Automaton has 45436 states and 67567 transitions. Word has length 231 [2019-09-10 02:38:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:00,769 INFO L475 AbstractCegarLoop]: Abstraction has 45436 states and 67567 transitions. [2019-09-10 02:38:00,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 45436 states and 67567 transitions. [2019-09-10 02:38:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 02:38:00,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:00,822 INFO L399 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] [2019-09-10 02:38:00,823 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1903290686, now seen corresponding path program 1 times [2019-09-10 02:38:00,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:00,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:00,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:01,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:01,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:38:01,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:01,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:38:01,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:38:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:38:01,028 INFO L87 Difference]: Start difference. First operand 45436 states and 67567 transitions. Second operand 11 states. [2019-09-10 02:38:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:01,725 INFO L93 Difference]: Finished difference Result 46196 states and 68647 transitions. [2019-09-10 02:38:01,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:38:01,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-09-10 02:38:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:01,892 INFO L225 Difference]: With dead ends: 46196 [2019-09-10 02:38:01,893 INFO L226 Difference]: Without dead ends: 46196 [2019-09-10 02:38:01,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:38:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46196 states. [2019-09-10 02:38:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46196 to 46036. [2019-09-10 02:38:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46036 states. [2019-09-10 02:38:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46036 states to 46036 states and 68407 transitions. [2019-09-10 02:38:05,064 INFO L78 Accepts]: Start accepts. Automaton has 46036 states and 68407 transitions. Word has length 232 [2019-09-10 02:38:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:05,064 INFO L475 AbstractCegarLoop]: Abstraction has 46036 states and 68407 transitions. [2019-09-10 02:38:05,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:38:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 46036 states and 68407 transitions. [2019-09-10 02:38:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 02:38:05,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:05,109 INFO L399 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] [2019-09-10 02:38:05,109 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash -179506284, now seen corresponding path program 1 times [2019-09-10 02:38:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:05,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:05,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:05,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:05,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:05,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:38:05,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:05,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:38:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:38:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:38:05,314 INFO L87 Difference]: Start difference. First operand 46036 states and 68407 transitions. Second operand 11 states. [2019-09-10 02:38:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:05,732 INFO L93 Difference]: Finished difference Result 46356 states and 68607 transitions. [2019-09-10 02:38:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:38:05,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-09-10 02:38:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:05,853 INFO L225 Difference]: With dead ends: 46356 [2019-09-10 02:38:05,853 INFO L226 Difference]: Without dead ends: 46356 [2019-09-10 02:38:05,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:38:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46356 states. [2019-09-10 02:38:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46356 to 46036. [2019-09-10 02:38:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46036 states. [2019-09-10 02:38:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46036 states to 46036 states and 68207 transitions. [2019-09-10 02:38:07,224 INFO L78 Accepts]: Start accepts. Automaton has 46036 states and 68207 transitions. Word has length 232 [2019-09-10 02:38:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:07,224 INFO L475 AbstractCegarLoop]: Abstraction has 46036 states and 68207 transitions. [2019-09-10 02:38:07,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:38:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 46036 states and 68207 transitions. [2019-09-10 02:38:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 02:38:07,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:07,272 INFO L399 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] [2019-09-10 02:38:07,272 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:07,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1544271440, now seen corresponding path program 1 times [2019-09-10 02:38:07,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:07,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:07,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:07,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:38:07,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:07,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:38:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:38:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:07,456 INFO L87 Difference]: Start difference. First operand 46036 states and 68207 transitions. Second operand 9 states. [2019-09-10 02:38:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:07,797 INFO L93 Difference]: Finished difference Result 46116 states and 67977 transitions. [2019-09-10 02:38:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:38:07,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-09-10 02:38:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:07,936 INFO L225 Difference]: With dead ends: 46116 [2019-09-10 02:38:07,937 INFO L226 Difference]: Without dead ends: 46116 [2019-09-10 02:38:07,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:38:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46116 states. [2019-09-10 02:38:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46116 to 45836. [2019-09-10 02:38:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45836 states. [2019-09-10 02:38:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45836 states to 45836 states and 67637 transitions. [2019-09-10 02:38:09,145 INFO L78 Accepts]: Start accepts. Automaton has 45836 states and 67637 transitions. Word has length 230 [2019-09-10 02:38:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:09,146 INFO L475 AbstractCegarLoop]: Abstraction has 45836 states and 67637 transitions. [2019-09-10 02:38:09,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:38:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45836 states and 67637 transitions. [2019-09-10 02:38:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 02:38:09,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:09,188 INFO L399 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] [2019-09-10 02:38:09,188 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1317898465, now seen corresponding path program 1 times [2019-09-10 02:38:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:09,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:09,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:09,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:09,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:09,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:09,361 INFO L87 Difference]: Start difference. First operand 45836 states and 67637 transitions. Second operand 6 states. [2019-09-10 02:38:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:10,381 INFO L93 Difference]: Finished difference Result 91287 states and 135147 transitions. [2019-09-10 02:38:10,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:38:10,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 233 [2019-09-10 02:38:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:10,709 INFO L225 Difference]: With dead ends: 91287 [2019-09-10 02:38:10,709 INFO L226 Difference]: Without dead ends: 83933 [2019-09-10 02:38:10,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:38:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83933 states. [2019-09-10 02:38:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83933 to 83168. [2019-09-10 02:38:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83168 states. [2019-09-10 02:38:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83168 states to 83168 states and 123597 transitions. [2019-09-10 02:38:12,810 INFO L78 Accepts]: Start accepts. Automaton has 83168 states and 123597 transitions. Word has length 233 [2019-09-10 02:38:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:12,810 INFO L475 AbstractCegarLoop]: Abstraction has 83168 states and 123597 transitions. [2019-09-10 02:38:12,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:38:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 83168 states and 123597 transitions. [2019-09-10 02:38:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 02:38:12,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:12,892 INFO L399 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] [2019-09-10 02:38:12,893 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 192206733, now seen corresponding path program 1 times [2019-09-10 02:38:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:12,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:12,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:38:13,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:13,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:13,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:13,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:13,034 INFO L87 Difference]: Start difference. First operand 83168 states and 123597 transitions. Second operand 3 states. [2019-09-10 02:38:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:14,948 INFO L93 Difference]: Finished difference Result 98378 states and 150855 transitions. [2019-09-10 02:38:14,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:14,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 02:38:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:15,335 INFO L225 Difference]: With dead ends: 98378 [2019-09-10 02:38:15,336 INFO L226 Difference]: Without dead ends: 98378 [2019-09-10 02:38:15,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98378 states. [2019-09-10 02:38:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98378 to 98336. [2019-09-10 02:38:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98336 states. [2019-09-10 02:38:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98336 states to 98336 states and 150813 transitions. [2019-09-10 02:38:17,558 INFO L78 Accepts]: Start accepts. Automaton has 98336 states and 150813 transitions. Word has length 233 [2019-09-10 02:38:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:17,558 INFO L475 AbstractCegarLoop]: Abstraction has 98336 states and 150813 transitions. [2019-09-10 02:38:17,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 98336 states and 150813 transitions. [2019-09-10 02:38:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 02:38:17,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:17,691 INFO L399 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] [2019-09-10 02:38:17,691 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1313787010, now seen corresponding path program 1 times [2019-09-10 02:38:17,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:17,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:17,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:17,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:17,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:38:17,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:17,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:38:17,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:17,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:38:17,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:38:17,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:17,809 INFO L87 Difference]: Start difference. First operand 98336 states and 150813 transitions. Second operand 3 states. [2019-09-10 02:38:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:18,344 INFO L93 Difference]: Finished difference Result 127562 states and 202599 transitions. [2019-09-10 02:38:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:18,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-10 02:38:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:18,825 INFO L225 Difference]: With dead ends: 127562 [2019-09-10 02:38:18,825 INFO L226 Difference]: Without dead ends: 127562 [2019-09-10 02:38:18,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127562 states. [2019-09-10 02:38:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127562 to 127520. [2019-09-10 02:38:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127520 states. [2019-09-10 02:38:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127520 states to 127520 states and 202557 transitions. [2019-09-10 02:38:24,355 INFO L78 Accepts]: Start accepts. Automaton has 127520 states and 202557 transitions. Word has length 234 [2019-09-10 02:38:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:24,355 INFO L475 AbstractCegarLoop]: Abstraction has 127520 states and 202557 transitions. [2019-09-10 02:38:24,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:38:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 127520 states and 202557 transitions. [2019-09-10 02:38:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 02:38:24,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:24,626 INFO L399 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] [2019-09-10 02:38:24,627 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1054897331, now seen corresponding path program 1 times [2019-09-10 02:38:24,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:24,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:24,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:24,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:24,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:24,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:24,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:38:24,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:24,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:38:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:38:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:38:24,821 INFO L87 Difference]: Start difference. First operand 127520 states and 202557 transitions. Second operand 7 states. [2019-09-10 02:38:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:31,864 INFO L93 Difference]: Finished difference Result 242222 states and 382847 transitions. [2019-09-10 02:38:31,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:38:31,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-10 02:38:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:32,747 INFO L225 Difference]: With dead ends: 242222 [2019-09-10 02:38:32,748 INFO L226 Difference]: Without dead ends: 241800 [2019-09-10 02:38:32,749 INFO L628 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-09-10 02:38:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241800 states. [2019-09-10 02:38:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241800 to 241770. [2019-09-10 02:38:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241770 states. [2019-09-10 02:38:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241770 states to 241770 states and 381969 transitions. [2019-09-10 02:38:45,617 INFO L78 Accepts]: Start accepts. Automaton has 241770 states and 381969 transitions. Word has length 235 [2019-09-10 02:38:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:45,617 INFO L475 AbstractCegarLoop]: Abstraction has 241770 states and 381969 transitions. [2019-09-10 02:38:45,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:38:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 241770 states and 381969 transitions. [2019-09-10 02:38:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 02:38:45,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:45,888 INFO L399 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] [2019-09-10 02:38:45,888 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1477735794, now seen corresponding path program 1 times [2019-09-10 02:38:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:45,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:45,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:45,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:38:46,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:46,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 02:38:46,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:46,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:38:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:38:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:38:46,370 INFO L87 Difference]: Start difference. First operand 241770 states and 381969 transitions. Second operand 26 states. [2019-09-10 02:38:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:48,616 INFO L93 Difference]: Finished difference Result 267557 states and 423418 transitions. [2019-09-10 02:38:48,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:38:48,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 236 [2019-09-10 02:38:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:49,637 INFO L225 Difference]: With dead ends: 267557 [2019-09-10 02:38:49,638 INFO L226 Difference]: Without dead ends: 267557 [2019-09-10 02:38:49,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:38:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267557 states. [2019-09-10 02:39:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267557 to 267246. [2019-09-10 02:39:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267246 states. [2019-09-10 02:39:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267246 states to 267246 states and 422937 transitions. [2019-09-10 02:39:03,676 INFO L78 Accepts]: Start accepts. Automaton has 267246 states and 422937 transitions. Word has length 236 [2019-09-10 02:39:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:03,677 INFO L475 AbstractCegarLoop]: Abstraction has 267246 states and 422937 transitions. [2019-09-10 02:39:03,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:39:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 267246 states and 422937 transitions. [2019-09-10 02:39:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:39:03,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:03,983 INFO L399 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] [2019-09-10 02:39:03,984 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1201823806, now seen corresponding path program 1 times [2019-09-10 02:39:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:03,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:03,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:03,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:03,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:39:04,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:04,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:39:04,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:04,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:39:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:39:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:39:04,158 INFO L87 Difference]: Start difference. First operand 267246 states and 422937 transitions. Second operand 10 states. [2019-09-10 02:39:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:06,798 INFO L93 Difference]: Finished difference Result 268926 states and 424907 transitions. [2019-09-10 02:39:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:39:06,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 240 [2019-09-10 02:39:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:07,939 INFO L225 Difference]: With dead ends: 268926 [2019-09-10 02:39:07,940 INFO L226 Difference]: Without dead ends: 268918 [2019-09-10 02:39:07,940 INFO L628 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-09-10 02:39:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268918 states. [2019-09-10 02:39:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268918 to 268918. [2019-09-10 02:39:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268918 states. [2019-09-10 02:39:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268918 states to 268918 states and 424895 transitions. [2019-09-10 02:39:23,491 INFO L78 Accepts]: Start accepts. Automaton has 268918 states and 424895 transitions. Word has length 240 [2019-09-10 02:39:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:23,492 INFO L475 AbstractCegarLoop]: Abstraction has 268918 states and 424895 transitions. [2019-09-10 02:39:23,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:39:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 268918 states and 424895 transitions. [2019-09-10 02:39:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 02:39:23,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:23,784 INFO L399 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, 1, 1] [2019-09-10 02:39:23,784 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1556209583, now seen corresponding path program 1 times [2019-09-10 02:39:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:23,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:39:29,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:39:29,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:39:29,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:29,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:39:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:39:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:39:29,658 INFO L87 Difference]: Start difference. First operand 268918 states and 424895 transitions. Second operand 5 states. [2019-09-10 02:39:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:31,032 INFO L93 Difference]: Finished difference Result 274648 states and 440831 transitions. [2019-09-10 02:39:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:39:31,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-10 02:39:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:32,919 INFO L225 Difference]: With dead ends: 274648 [2019-09-10 02:39:32,920 INFO L226 Difference]: Without dead ends: 274648 [2019-09-10 02:39:32,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:39:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274648 states. [2019-09-10 02:39:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274648 to 271782. [2019-09-10 02:39:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271782 states. [2019-09-10 02:39:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271782 states to 271782 states and 427877 transitions. [2019-09-10 02:39:46,256 INFO L78 Accepts]: Start accepts. Automaton has 271782 states and 427877 transitions. Word has length 245 [2019-09-10 02:39:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:46,256 INFO L475 AbstractCegarLoop]: Abstraction has 271782 states and 427877 transitions. [2019-09-10 02:39:46,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:39:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 271782 states and 427877 transitions. [2019-09-10 02:39:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 02:39:47,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:39:47,610 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:39:47,610 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:39:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1500388533, now seen corresponding path program 1 times [2019-09-10 02:39:47,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:39:47,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:47,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:39:47,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:39:47,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:39:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:39:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:39:47,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:39:47,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:39:47,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2019-09-10 02:39:47,756 INFO L207 CegarAbsIntRunner]: [44], [47], [50], [72], [76], [80], [83], [85], [109], [112], [122], [123], [139], [142], [151], [152], [155], [156], [157], [159], [269], [271], [275], [278], [279], [280], [283], [289], [313], [315], [317], [320], [328], [330], [331], [334], [343], [354], [356], [359], [363], [364], [366], [367], [370], [380], [381], [382], [393], [396], [402], [404], [423], [426], [435], [517], [613], [615], [616], [617], [624], [635], [637], [642], [666], [669], [683], [712], [714], [727], [728], [762], [766], [769], [777], [780], [797], [801], [804], [810], [811], [813], [838], [844], [853], [857], [859], [861], [864], [871], [878], [885], [892], [899], [906], [913], [920], [927], [934], [937], [939], [1146], [1200], [1202], [1219], [1223], [1228], [1231], [1240], [1241], [1252], [1255], [1256], [1259], [1262], [1293], [1296], [1298], [1367], [1371], [1375], [1378], [1380], [1381], [1384], [1390], [1411], [1414], [1428], [1436], [1439], [1441], [1444], [1448], [1642], [1644], [1646], [1648], [1649], [1661], [1662], [1663], [1664], [1665], [1666], [1667], [1679], [1689], [1690], [1691], [1692], [1693], [1694], [1697], [1698], [1699], [1700], [1701], [1703], [1704], [1705], [1706], [1713], [1714], [1715], [1716], [1717], [1718], [1719], [1720], [1721], [1723], [1724], [1729], [1730], [1733], [1734], [1739], [1740], [1741], [1742], [1753], [1769], [1770], [1777], [1778], [1779], [1780], [1781], [1789], [1790], [1791], [1793], [1794], [1795], [1796], [1797], [1798], [1799], [1800], [1801], [1803], [1804], [1805], [1806], [1821], [1822], [1833], [1847], [1848], [1859], [1861], [1862], [1879], [1881], [1882], [1883], [1884], [1885], [1886], [1887], [1909], [1910], [1911], [1912], [1913], [1914], [1915], [1916], [1917] [2019-09-10 02:39:47,849 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:39:47,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:39:48,000 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:39:48,001 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 203 root evaluator evaluations with a maximum evaluation depth of 0. Performed 203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 372 variables. [2019-09-10 02:39:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:39:48,007 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:39:48,171 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:39:48,172 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:39:48,184 INFO L420 sIntCurrentIteration]: We unified 250 AI predicates to 250 [2019-09-10 02:39:48,184 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:39:48,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:39:48,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-09-10 02:39:48,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:39:48,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:39:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:39:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:39:48,188 INFO L87 Difference]: Start difference. First operand 271782 states and 427877 transitions. Second operand 2 states. [2019-09-10 02:39:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:39:48,190 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:39:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:39:48,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 251 [2019-09-10 02:39:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:39:48,190 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:39:48,191 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:39:48,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:39:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:39:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:39:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:39:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:39:48,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2019-09-10 02:39:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:39:48,193 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:39:48,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:39:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:39:48,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:39:48,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:39:48 BoogieIcfgContainer [2019-09-10 02:39:48,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:39:48,205 INFO L168 Benchmark]: Toolchain (without parser) took 146330.43 ms. Allocated memory was 132.6 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 86.0 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-09-10 02:39:48,206 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:39:48,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1358.13 ms. Allocated memory was 132.6 MB in the beginning and 205.0 MB in the end (delta: 72.4 MB). Free memory was 85.8 MB in the beginning and 136.2 MB in the end (delta: -50.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:48,213 INFO L168 Benchmark]: Boogie Preprocessor took 193.18 ms. Allocated memory is still 205.0 MB. Free memory was 135.5 MB in the beginning and 126.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:48,214 INFO L168 Benchmark]: RCFGBuilder took 2545.67 ms. Allocated memory was 205.0 MB in the beginning and 262.1 MB in the end (delta: 57.1 MB). Free memory was 126.7 MB in the beginning and 162.8 MB in the end (delta: -36.1 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:39:48,215 INFO L168 Benchmark]: TraceAbstraction took 142228.94 ms. Allocated memory was 262.1 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 162.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-09-10 02:39:48,228 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1358.13 ms. Allocated memory was 132.6 MB in the beginning and 205.0 MB in the end (delta: 72.4 MB). Free memory was 85.8 MB in the beginning and 136.2 MB in the end (delta: -50.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 193.18 ms. Allocated memory is still 205.0 MB. Free memory was 135.5 MB in the beginning and 126.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2545.67 ms. Allocated memory was 205.0 MB in the beginning and 262.1 MB in the end (delta: 57.1 MB). Free memory was 126.7 MB in the beginning and 162.8 MB in the end (delta: -36.1 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142228.94 ms. Allocated memory was 262.1 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 162.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2970]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 115 procedures, 787 locations, 1 error locations. SAFE Result, 142.1s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 46.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23348 SDtfs, 11290 SDslu, 144236 SDs, 0 SdLazy, 14243 SolverSat, 1260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271782occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.92 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 78.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 5937 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 6197 NumberOfCodeBlocks, 6197 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 6170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1809337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 1013/1016 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...