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_spec27_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:52:07,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:52:07,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:52:07,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:52:07,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:52:07,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:52:07,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:52:07,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:52:07,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:52:07,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:52:07,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:52:07,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:52:07,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:52:07,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:52:07,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:52:07,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:52:07,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:52:07,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:52:07,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:52:07,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:52:07,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:52:07,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:52:07,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:52:07,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:52:07,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:52:07,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:52:07,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:52:07,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:52:07,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:52:07,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:52:07,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:52:07,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:52:07,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:52:07,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:52:07,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:52:07,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:52:07,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:52:07,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:52:07,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:52:07,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:52:07,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:52:07,576 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-10-03 02:52:07,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:52:07,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:52:07,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:52:07,592 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:52:07,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:52:07,593 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:52:07,593 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:52:07,593 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:52:07,593 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:52:07,594 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:52:07,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:52:07,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:52:07,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:52:07,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:52:07,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:52:07,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:52:07,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:52:07,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:52:07,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:52:07,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:52:07,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:52:07,597 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:52:07,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:52:07,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:52:07,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:52:07,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:52:07,598 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:52:07,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:52:07,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:52:07,598 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:52:07,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:52:07,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:52:07,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:52:07,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:52:07,645 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:52:07,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product23.cil.c [2019-10-03 02:52:07,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd618814/664018b69dce49abbae50e9fe63238f5/FLAGe8204cd77 [2019-10-03 02:52:08,402 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:52:08,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product23.cil.c [2019-10-03 02:52:08,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd618814/664018b69dce49abbae50e9fe63238f5/FLAGe8204cd77 [2019-10-03 02:52:08,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd618814/664018b69dce49abbae50e9fe63238f5 [2019-10-03 02:52:08,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:52:08,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:52:08,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:52:08,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:52:08,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:52:08,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:52:08" (1/1) ... [2019-10-03 02:52:08,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5263035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:08, skipping insertion in model container [2019-10-03 02:52:08,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:52:08" (1/1) ... [2019-10-03 02:52:08,604 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:52:08,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:52:09,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:52:09,494 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:52:09,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:52:09,709 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:52:09,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09 WrapperNode [2019-10-03 02:52:09,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:52:09,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:52:09,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:52:09,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:52:09,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... [2019-10-03 02:52:09,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:52:09,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:52:09,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:52:09,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:52:09,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:52:09,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:52:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:52:09,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:52:09,988 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:52:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:52:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:52:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:52:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:52:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:52:09,990 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:52:09,990 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:52:09,991 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:52:09,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:52:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:52:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:52:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:52:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:52:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:52:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:52:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:52:09,994 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:52:09,994 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:52:09,994 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:52:09,994 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:52:09,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-03 02:52:09,995 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:52:09,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:52:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:52:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:52:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:52:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:52:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:52:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:52:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:52:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:52:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:52:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:52:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:52:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:52:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:52:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:52:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:52:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:52:10,000 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:52:10,000 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:52:10,000 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:52:10,000 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:52:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:52:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:52:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:52:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:52:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:52:10,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:52:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:52:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:52:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:52:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-03 02:52:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:52:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:52:10,003 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-10-03 02:52:10,003 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:52:10,003 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:52:10,003 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:52:10,003 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:52:10,004 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:52:10,004 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:52:10,004 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:52:10,004 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:52:10,004 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:52:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:52:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:52:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:52:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:52:10,006 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:52:10,006 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:52:10,006 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:52:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:52:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:52:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:52:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:52:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:52:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:52:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:52:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:52:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:52:10,009 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:52:10,009 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:52:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:52:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:52:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:52:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:52:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:52:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:52:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:52:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:52:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:52:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:52:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:52:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:52:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:52:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:52:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:52:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:52:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:52:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:52:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:52:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:52:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:52:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:52:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:52:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:52:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:52:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:52:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:52:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:52:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:52:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:52:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:52:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:52:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:52:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:52:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:52:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:52:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:52:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:52:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:52:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:52:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:52:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:52:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:52:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:52:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:52:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:52:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:52:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:52:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:52:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:52:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:52:10,037 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:52:10,038 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:52:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:52:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:52:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:52:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:52:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:52:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-03 02:52:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-03 02:52:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:52:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:52:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:52:12,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:52:12,240 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:52:12,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:52:12 BoogieIcfgContainer [2019-10-03 02:52:12,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:52:12,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:52:12,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:52:12,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:52:12,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:52:08" (1/3) ... [2019-10-03 02:52:12,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9c0960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:52:12, skipping insertion in model container [2019-10-03 02:52:12,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:52:09" (2/3) ... [2019-10-03 02:52:12,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9c0960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:52:12, skipping insertion in model container [2019-10-03 02:52:12,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:52:12" (3/3) ... [2019-10-03 02:52:12,253 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product23.cil.c [2019-10-03 02:52:12,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:52:12,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:52:12,299 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:52:12,341 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:52:12,341 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:52:12,341 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:52:12,342 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:52:12,342 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:52:12,342 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:52:12,343 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:52:12,344 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:52:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states. [2019-10-03 02:52:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-03 02:52:12,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:12,403 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:12,406 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:12,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1102474150, now seen corresponding path program 1 times [2019-10-03 02:52:12,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:12,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 02:52:13,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:13,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:52:13,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:13,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:52:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:52:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:52:13,228 INFO L87 Difference]: Start difference. First operand 577 states. Second operand 2 states. [2019-10-03 02:52:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:13,321 INFO L93 Difference]: Finished difference Result 540 states and 736 transitions. [2019-10-03 02:52:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:52:13,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 188 [2019-10-03 02:52:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:13,360 INFO L225 Difference]: With dead ends: 540 [2019-10-03 02:52:13,360 INFO L226 Difference]: Without dead ends: 531 [2019-10-03 02:52:13,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:52:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-03 02:52:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2019-10-03 02:52:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-03 02:52:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 725 transitions. [2019-10-03 02:52:13,479 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 725 transitions. Word has length 188 [2019-10-03 02:52:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:13,481 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 725 transitions. [2019-10-03 02:52:13,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:52:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 725 transitions. [2019-10-03 02:52:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 02:52:13,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:13,487 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:13,488 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 581217033, now seen corresponding path program 1 times [2019-10-03 02:52:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:13,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:13,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:13,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:13,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 02:52:13,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:13,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:13,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:13,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:13,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:13,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:13,768 INFO L87 Difference]: Start difference. First operand 531 states and 725 transitions. Second operand 3 states. [2019-10-03 02:52:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:13,803 INFO L93 Difference]: Finished difference Result 534 states and 728 transitions. [2019-10-03 02:52:13,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:13,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-03 02:52:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:13,808 INFO L225 Difference]: With dead ends: 534 [2019-10-03 02:52:13,808 INFO L226 Difference]: Without dead ends: 534 [2019-10-03 02:52:13,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-03 02:52:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 533. [2019-10-03 02:52:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-03 02:52:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 727 transitions. [2019-10-03 02:52:13,834 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 727 transitions. Word has length 189 [2019-10-03 02:52:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:13,834 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 727 transitions. [2019-10-03 02:52:13,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 727 transitions. [2019-10-03 02:52:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:52:13,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:13,839 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:13,839 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash -762170887, now seen corresponding path program 1 times [2019-10-03 02:52:13,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:13,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:13,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:13,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 02:52:14,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:14,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:14,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:14,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:14,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:14,059 INFO L87 Difference]: Start difference. First operand 533 states and 727 transitions. Second operand 3 states. [2019-10-03 02:52:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:14,082 INFO L93 Difference]: Finished difference Result 576 states and 800 transitions. [2019-10-03 02:52:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:14,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-03 02:52:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:14,089 INFO L225 Difference]: With dead ends: 576 [2019-10-03 02:52:14,090 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:52:14,091 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:52:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 575. [2019-10-03 02:52:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-03 02:52:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 799 transitions. [2019-10-03 02:52:14,128 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 799 transitions. Word has length 199 [2019-10-03 02:52:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:14,129 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 799 transitions. [2019-10-03 02:52:14,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 799 transitions. [2019-10-03 02:52:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:52:14,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:14,137 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10-03 02:52:14,137 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2111399604, now seen corresponding path program 1 times [2019-10-03 02:52:14,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:14,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:14,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 02:52:14,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:14,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:14,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:14,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:14,334 INFO L87 Difference]: Start difference. First operand 575 states and 799 transitions. Second operand 3 states. [2019-10-03 02:52:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:14,370 INFO L93 Difference]: Finished difference Result 657 states and 938 transitions. [2019-10-03 02:52:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:14,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-10-03 02:52:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:14,378 INFO L225 Difference]: With dead ends: 657 [2019-10-03 02:52:14,378 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:52:14,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:52:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 656. [2019-10-03 02:52:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-03 02:52:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 937 transitions. [2019-10-03 02:52:14,414 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 937 transitions. Word has length 200 [2019-10-03 02:52:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:14,415 INFO L475 AbstractCegarLoop]: Abstraction has 656 states and 937 transitions. [2019-10-03 02:52:14,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 937 transitions. [2019-10-03 02:52:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:52:14,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:14,424 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:14,426 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1097400825, now seen corresponding path program 1 times [2019-10-03 02:52:14,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:14,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:14,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:14,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:14,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 02:52:14,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:14,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:14,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:14,856 INFO L87 Difference]: Start difference. First operand 656 states and 937 transitions. Second operand 3 states. [2019-10-03 02:52:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:14,898 INFO L93 Difference]: Finished difference Result 813 states and 1202 transitions. [2019-10-03 02:52:14,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:14,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-10-03 02:52:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:14,906 INFO L225 Difference]: With dead ends: 813 [2019-10-03 02:52:14,907 INFO L226 Difference]: Without dead ends: 813 [2019-10-03 02:52:14,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-10-03 02:52:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 812. [2019-10-03 02:52:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2019-10-03 02:52:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1201 transitions. [2019-10-03 02:52:14,948 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1201 transitions. Word has length 201 [2019-10-03 02:52:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:14,950 INFO L475 AbstractCegarLoop]: Abstraction has 812 states and 1201 transitions. [2019-10-03 02:52:14,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1201 transitions. [2019-10-03 02:52:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:52:14,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:14,956 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:14,957 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1333357236, now seen corresponding path program 1 times [2019-10-03 02:52:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:14,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:14,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:14,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:14,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 02:52:15,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:15,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:52:15,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:15,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:52:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:52:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:15,255 INFO L87 Difference]: Start difference. First operand 812 states and 1201 transitions. Second operand 3 states. [2019-10-03 02:52:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:15,288 INFO L93 Difference]: Finished difference Result 1113 states and 1706 transitions. [2019-10-03 02:52:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:52:15,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-03 02:52:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:15,300 INFO L225 Difference]: With dead ends: 1113 [2019-10-03 02:52:15,300 INFO L226 Difference]: Without dead ends: 1113 [2019-10-03 02:52:15,301 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:52:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-03 02:52:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1112. [2019-10-03 02:52:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-10-03 02:52:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1705 transitions. [2019-10-03 02:52:15,371 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1705 transitions. Word has length 202 [2019-10-03 02:52:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:15,373 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1705 transitions. [2019-10-03 02:52:15,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:52:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1705 transitions. [2019-10-03 02:52:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:52:15,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:15,386 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:15,386 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1889313127, now seen corresponding path program 1 times [2019-10-03 02:52:15,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:15,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 02:52:15,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:15,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:52:15,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:15,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:52:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:52:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:52:15,724 INFO L87 Difference]: Start difference. First operand 1112 states and 1705 transitions. Second operand 8 states. [2019-10-03 02:52:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:15,786 INFO L93 Difference]: Finished difference Result 1112 states and 1704 transitions. [2019-10-03 02:52:15,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:52:15,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 205 [2019-10-03 02:52:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:15,794 INFO L225 Difference]: With dead ends: 1112 [2019-10-03 02:52:15,794 INFO L226 Difference]: Without dead ends: 1112 [2019-10-03 02:52:15,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:52:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2019-10-03 02:52:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2019-10-03 02:52:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-10-03 02:52:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1704 transitions. [2019-10-03 02:52:15,828 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1704 transitions. Word has length 205 [2019-10-03 02:52:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:15,828 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1704 transitions. [2019-10-03 02:52:15,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:52:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1704 transitions. [2019-10-03 02:52:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:52:15,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:15,835 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:15,836 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1379903379, now seen corresponding path program 1 times [2019-10-03 02:52:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:15,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:15,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 02:52:16,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:16,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:52:16,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:16,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:52:16,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:52:16,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:52:16,077 INFO L87 Difference]: Start difference. First operand 1112 states and 1704 transitions. Second operand 7 states. [2019-10-03 02:52:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:19,433 INFO L93 Difference]: Finished difference Result 1383 states and 2060 transitions. [2019-10-03 02:52:19,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:52:19,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2019-10-03 02:52:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:19,449 INFO L225 Difference]: With dead ends: 1383 [2019-10-03 02:52:19,449 INFO L226 Difference]: Without dead ends: 1379 [2019-10-03 02:52:19,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:52:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-10-03 02:52:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1370. [2019-10-03 02:52:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-10-03 02:52:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2044 transitions. [2019-10-03 02:52:19,527 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2044 transitions. Word has length 212 [2019-10-03 02:52:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:19,530 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2044 transitions. [2019-10-03 02:52:19,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:52:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2044 transitions. [2019-10-03 02:52:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:52:19,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:19,539 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:19,539 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1428432739, now seen corresponding path program 1 times [2019-10-03 02:52:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:19,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:19,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:19,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-03 02:52:20,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:20,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:52:20,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:20,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:52:20,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:52:20,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:52:20,131 INFO L87 Difference]: Start difference. First operand 1370 states and 2044 transitions. Second operand 26 states. [2019-10-03 02:52:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:21,281 INFO L93 Difference]: Finished difference Result 1501 states and 2214 transitions. [2019-10-03 02:52:21,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:52:21,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 213 [2019-10-03 02:52:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:21,292 INFO L225 Difference]: With dead ends: 1501 [2019-10-03 02:52:21,293 INFO L226 Difference]: Without dead ends: 1493 [2019-10-03 02:52:21,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:52:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-10-03 02:52:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1488. [2019-10-03 02:52:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-10-03 02:52:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2195 transitions. [2019-10-03 02:52:21,350 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2195 transitions. Word has length 213 [2019-10-03 02:52:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:21,351 INFO L475 AbstractCegarLoop]: Abstraction has 1488 states and 2195 transitions. [2019-10-03 02:52:21,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:52:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2195 transitions. [2019-10-03 02:52:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-03 02:52:21,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:21,360 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:21,360 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1536275324, now seen corresponding path program 1 times [2019-10-03 02:52:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:21,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:21,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:21,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:52:21,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:21,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:52:21,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:21,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:52:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:52:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:52:21,687 INFO L87 Difference]: Start difference. First operand 1488 states and 2195 transitions. Second operand 8 states. [2019-10-03 02:52:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:27,672 INFO L93 Difference]: Finished difference Result 2778 states and 3937 transitions. [2019-10-03 02:52:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:52:27,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2019-10-03 02:52:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:27,699 INFO L225 Difference]: With dead ends: 2778 [2019-10-03 02:52:27,699 INFO L226 Difference]: Without dead ends: 2778 [2019-10-03 02:52:27,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:52:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-10-03 02:52:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2766. [2019-10-03 02:52:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2019-10-03 02:52:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3927 transitions. [2019-10-03 02:52:27,886 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3927 transitions. Word has length 244 [2019-10-03 02:52:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:27,888 INFO L475 AbstractCegarLoop]: Abstraction has 2766 states and 3927 transitions. [2019-10-03 02:52:27,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:52:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3927 transitions. [2019-10-03 02:52:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-03 02:52:27,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:27,911 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:27,911 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1613499385, now seen corresponding path program 1 times [2019-10-03 02:52:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:27,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:27,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:52:28,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:52:28,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-03 02:52:28,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:28,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 02:52:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 02:52:28,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:52:28,657 INFO L87 Difference]: Start difference. First operand 2766 states and 3927 transitions. Second operand 20 states. [2019-10-03 02:52:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:29,240 INFO L93 Difference]: Finished difference Result 2470 states and 3519 transitions. [2019-10-03 02:52:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:52:29,241 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 245 [2019-10-03 02:52:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:29,258 INFO L225 Difference]: With dead ends: 2470 [2019-10-03 02:52:29,258 INFO L226 Difference]: Without dead ends: 2470 [2019-10-03 02:52:29,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-10-03 02:52:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-10-03 02:52:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2460. [2019-10-03 02:52:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2460 states. [2019-10-03 02:52:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3505 transitions. [2019-10-03 02:52:29,345 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3505 transitions. Word has length 245 [2019-10-03 02:52:29,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:29,346 INFO L475 AbstractCegarLoop]: Abstraction has 2460 states and 3505 transitions. [2019-10-03 02:52:29,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 02:52:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3505 transitions. [2019-10-03 02:52:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-03 02:52:29,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:52:29,355 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:52:29,355 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:52:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1147475467, now seen corresponding path program 1 times [2019-10-03 02:52:29,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:52:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:52:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:52:29,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:52:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:52:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-03 02:52:29,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:52:29,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:52:29,580 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2019-10-03 02:52:29,582 INFO L207 CegarAbsIntRunner]: [44], [46], [49], [51], [53], [56], [80], [83], [93], [94], [97], [106], [127], [130], [140], [141], [157], [160], [174], [175], [177], [287], [290], [291], [292], [295], [301], [323], [335], [337], [351], [354], [363], [364], [365], [366], [368], [369], [372], [382], [383], [420], [422], [425], [427], [430], [436], [438], [441], [443], [445], [448], [456], [458], [488], [491], [497], [643], [645], [646], [647], [653], [656], [662], [683], [686], [700], [729], [730], [731], [734], [740], [741], [743], [746], [749], [755], [756], [758], [762], [765], [779], [783], [786], [804], [807], [828], [834], [843], [847], [849], [851], [854], [861], [868], [871], [873], [1009], [1011], [1028], [1032], [1035], [1049], [1157], [1211], [1233], [1234], [1237], [1243], [1244], [1247], [1248], [1251], [1254], [1285], [1288], [1290], [1403], [1406], [1420], [1426], [1429], [1438], [1439], [1442], [1451], [1492], [1495], [1504], [1632], [1634], [1636], [1638], [1639], [1643], [1654], [1655], [1656], [1657], [1658], [1659], [1660], [1680], [1690], [1691], [1692], [1693], [1694], [1695], [1698], [1699], [1700], [1701], [1708], [1714], [1715], [1716], [1717], [1718], [1724], [1725], [1726], [1738], [1739], [1740], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1770], [1771], [1784], [1785], [1786], [1788], [1789], [1790], [1791], [1792], [1793], [1794], [1795], [1796], [1797], [1798], [1799], [1800], [1801], [1802], [1804], [1805], [1806], [1807], [1814], [1815], [1816], [1822], [1823], [1840], [1842], [1843], [1860], [1862], [1863], [1864], [1866], [1867], [1868], [1869], [1870], [1871], [1872], [1892], [1893], [1894], [1895], [1896], [1897], [1898], [1899], [1900], [1902] [2019-10-03 02:52:29,642 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:52:29,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:52:29,766 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:52:29,768 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-10-03 02:52:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:52:29,773 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:52:29,853 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:52:29,854 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:52:29,860 INFO L420 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2019-10-03 02:52:29,860 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:52:29,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:52:29,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-03 02:52:29,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:52:29,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:52:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:52:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:52:29,863 INFO L87 Difference]: Start difference. First operand 2460 states and 3505 transitions. Second operand 2 states. [2019-10-03 02:52:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:52:29,864 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:52:29,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:52:29,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 254 [2019-10-03 02:52:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:52:29,864 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:52:29,864 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:52:29,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:52:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:52:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:52:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:52:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:52:29,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2019-10-03 02:52:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:52:29,866 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:52:29,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:52:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:52:29,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:52:29,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:52:29 BoogieIcfgContainer [2019-10-03 02:52:29,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:52:29,876 INFO L168 Benchmark]: Toolchain (without parser) took 21289.68 ms. Allocated memory was 140.5 MB in the beginning and 551.6 MB in the end (delta: 411.0 MB). Free memory was 85.4 MB in the beginning and 77.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 419.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:52:29,877 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:52:29,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1123.38 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 85.4 MB in the beginning and 138.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:52:29,879 INFO L168 Benchmark]: Boogie Preprocessor took 178.27 ms. Allocated memory is still 204.5 MB. Free memory was 138.7 MB in the beginning and 129.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:52:29,880 INFO L168 Benchmark]: RCFGBuilder took 2352.66 ms. Allocated memory was 204.5 MB in the beginning and 262.1 MB in the end (delta: 57.7 MB). Free memory was 129.2 MB in the beginning and 160.1 MB in the end (delta: -30.9 MB). Peak memory consumption was 86.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:52:29,881 INFO L168 Benchmark]: TraceAbstraction took 17630.36 ms. Allocated memory was 262.1 MB in the beginning and 551.6 MB in the end (delta: 289.4 MB). Free memory was 160.1 MB in the beginning and 77.3 MB in the end (delta: 82.8 MB). Peak memory consumption was 372.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:52:29,885 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.22 ms. Allocated memory is still 140.5 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1123.38 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 85.4 MB in the beginning and 138.7 MB in the end (delta: -53.3 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.27 ms. Allocated memory is still 204.5 MB. Free memory was 138.7 MB in the beginning and 129.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2352.66 ms. Allocated memory was 204.5 MB in the beginning and 262.1 MB in the end (delta: 57.7 MB). Free memory was 129.2 MB in the beginning and 160.1 MB in the end (delta: -30.9 MB). Peak memory consumption was 86.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17630.36 ms. Allocated memory was 262.1 MB in the beginning and 551.6 MB in the end (delta: 289.4 MB). Free memory was 160.1 MB in the beginning and 77.3 MB in the end (delta: 82.8 MB). Peak memory consumption was 372.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2272]: 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 114 procedures, 781 locations, 1 error locations. SAFE Result, 17.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8157 SDtfs, 2988 SDslu, 39621 SDs, 0 SdLazy, 7962 SolverSat, 1113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2766occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.992094861660079 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2552 NumberOfCodeBlocks, 2552 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2540 ConstructedInterpolants, 0 QuantifiedInterpolants, 704881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 381/383 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...