java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec9_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:13:13,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:13:13,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:13:13,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:13:13,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:13:13,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:13:13,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:13:13,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:13:13,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:13:13,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:13:13,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:13:13,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:13:13,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:13:13,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:13:13,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:13:13,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:13:13,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:13:13,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:13:13,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:13:13,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:13:13,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:13:13,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:13:13,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:13:13,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:13:13,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:13:13,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:13:13,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:13:13,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:13:13,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:13:13,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:13:13,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:13:13,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:13:13,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:13:13,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:13:13,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:13:13,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:13:13,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:13:13,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:13:13,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:13:13,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:13:13,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:13:13,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:13:13,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:13:13,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:13:13,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:13:13,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:13:13,429 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:13:13,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:13:13,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:13:13,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:13:13,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:13:13,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:13:13,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:13:13,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:13:13,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:13:13,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:13:13,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:13:13,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:13:13,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:13:13,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:13:13,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:13:13,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:13:13,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:13:13,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:13:13,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:13:13,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:13:13,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:13:13,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:13:13,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:13:13,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:13:13,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:13:13,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:13:13,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:13:13,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:13:13,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:13:13,494 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:13:13,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product30.cil.c [2019-10-02 14:13:13,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3e1c3e5/5611137e9a9c4e85ae29cc51387d7824/FLAG4bb354dbe [2019-10-02 14:13:14,225 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:13:14,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product30.cil.c [2019-10-02 14:13:14,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3e1c3e5/5611137e9a9c4e85ae29cc51387d7824/FLAG4bb354dbe [2019-10-02 14:13:14,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3e1c3e5/5611137e9a9c4e85ae29cc51387d7824 [2019-10-02 14:13:14,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:13:14,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:13:14,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:13:14,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:13:14,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:13:14,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:13:14" (1/1) ... [2019-10-02 14:13:14,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26497d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:14, skipping insertion in model container [2019-10-02 14:13:14,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:13:14" (1/1) ... [2019-10-02 14:13:14,445 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:13:14,537 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:13:15,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:13:15,403 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:13:15,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:13:15,625 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:13:15,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15 WrapperNode [2019-10-02 14:13:15,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:13:15,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:13:15,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:13:15,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:13:15,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... [2019-10-02 14:13:15,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:13:15,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:13:15,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:13:15,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:13:15,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:13:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:13:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:13:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:13:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:13:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:13:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:13:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:13:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:13:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:13:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:13:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:13:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:13:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:13:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:13:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:13:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:13:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:13:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:13:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:13:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:13:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:13:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:13:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:13:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:13:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:13:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:13:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:13:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:13:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 14:13:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 14:13:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 14:13:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:13:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:13:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:13:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:13:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:13:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:13:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:13:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:13:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:13:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:13:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:13:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:13:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:13:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 14:13:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 14:13:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:13:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:13:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:13:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:13:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:13:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:13:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:13:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:13:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:13:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:13:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:13:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:13:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:13:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:13:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:13:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:13:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:13:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:13:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:13:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:13:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:13:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:13:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:13:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:13:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:13:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:13:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:13:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:13:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:13:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:13:15,897 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:13:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:13:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:13:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:13:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:13:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:13:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:13:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:13:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:13:15,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:13:15,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:13:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:13:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:13:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:13:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:13:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:13:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:13:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:13:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:13:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:13:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:13:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:13:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:13:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:13:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:13:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:13:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:13:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:13:15,907 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:13:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:13:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:13:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:13:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:13:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:13:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:13:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:13:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:13:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:13:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:13:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:13:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:13:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:13:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:13:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:13:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:13:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:13:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:13:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:13:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:13:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:13:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:13:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:13:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:13:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:13:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:13:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:13:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:13:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:13:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 14:13:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:13:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:13:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 14:13:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 14:13:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:13:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:13:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:13:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:13:15,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:13:15,933 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:13:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:13:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:13:15,934 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:13:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:13:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:13:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:13:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:13:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:13:15,935 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:13:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:13:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:13:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:13:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:13:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:13:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:13:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:13:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:13:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:13:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:13:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:13:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:13:15,938 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:13:15,938 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:13:15,938 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:13:15,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:13:15,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:13:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:13:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:13:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:13:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:13:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:13:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:13:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:13:18,218 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:13:18,219 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:13:18,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:13:18 BoogieIcfgContainer [2019-10-02 14:13:18,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:13:18,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:13:18,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:13:18,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:13:18,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:13:14" (1/3) ... [2019-10-02 14:13:18,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72115eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:13:18, skipping insertion in model container [2019-10-02 14:13:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:15" (2/3) ... [2019-10-02 14:13:18,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72115eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:13:18, skipping insertion in model container [2019-10-02 14:13:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:13:18" (3/3) ... [2019-10-02 14:13:18,233 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product30.cil.c [2019-10-02 14:13:18,244 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:13:18,263 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:13:18,281 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:13:18,329 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:13:18,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:13:18,330 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:13:18,331 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:13:18,334 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:13:18,335 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:13:18,335 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:13:18,335 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:13:18,335 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:13:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states. [2019-10-02 14:13:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:13:18,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:18,412 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] [2019-10-02 14:13:18,415 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash -702244773, now seen corresponding path program 1 times [2019-10-02 14:13:18,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:18,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:18,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:19,069 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-02 14:13:19,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:19,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:13:19,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:13:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:13:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:13:19,090 INFO L87 Difference]: Start difference. First operand 548 states. Second operand 2 states. [2019-10-02 14:13:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:19,157 INFO L93 Difference]: Finished difference Result 782 states and 1030 transitions. [2019-10-02 14:13:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:13:19,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-02 14:13:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:19,183 INFO L225 Difference]: With dead ends: 782 [2019-10-02 14:13:19,183 INFO L226 Difference]: Without dead ends: 497 [2019-10-02 14:13:19,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:13:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-02 14:13:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-10-02 14:13:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-02 14:13:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 659 transitions. [2019-10-02 14:13:19,287 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 659 transitions. Word has length 158 [2019-10-02 14:13:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:19,290 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 659 transitions. [2019-10-02 14:13:19,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:13:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 659 transitions. [2019-10-02 14:13:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 14:13:19,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:19,295 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] [2019-10-02 14:13:19,295 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:19,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2104582375, now seen corresponding path program 1 times [2019-10-02 14:13:19,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:19,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:19,589 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-02 14:13:19,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:19,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:19,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:19,597 INFO L87 Difference]: Start difference. First operand 497 states and 659 transitions. Second operand 3 states. [2019-10-02 14:13:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:19,702 INFO L93 Difference]: Finished difference Result 765 states and 998 transitions. [2019-10-02 14:13:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:19,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 14:13:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:19,711 INFO L225 Difference]: With dead ends: 765 [2019-10-02 14:13:19,711 INFO L226 Difference]: Without dead ends: 500 [2019-10-02 14:13:19,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-02 14:13:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 499. [2019-10-02 14:13:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-10-02 14:13:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 661 transitions. [2019-10-02 14:13:19,752 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 661 transitions. Word has length 159 [2019-10-02 14:13:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:19,752 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 661 transitions. [2019-10-02 14:13:19,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 661 transitions. [2019-10-02 14:13:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 14:13:19,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:19,756 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] [2019-10-02 14:13:19,756 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1792836169, now seen corresponding path program 1 times [2019-10-02 14:13:19,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:19,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:19,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:19,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:19,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:19,962 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-02 14:13:19,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:19,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:19,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:19,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:19,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:19,965 INFO L87 Difference]: Start difference. First operand 499 states and 661 transitions. Second operand 3 states. [2019-10-02 14:13:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:20,047 INFO L93 Difference]: Finished difference Result 974 states and 1320 transitions. [2019-10-02 14:13:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:20,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 14:13:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:20,053 INFO L225 Difference]: With dead ends: 974 [2019-10-02 14:13:20,054 INFO L226 Difference]: Without dead ends: 540 [2019-10-02 14:13:20,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-02 14:13:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2019-10-02 14:13:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-10-02 14:13:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 730 transitions. [2019-10-02 14:13:20,091 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 730 transitions. Word has length 169 [2019-10-02 14:13:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:20,091 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 730 transitions. [2019-10-02 14:13:20,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 730 transitions. [2019-10-02 14:13:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 14:13:20,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:20,096 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] [2019-10-02 14:13:20,096 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2122223245, now seen corresponding path program 1 times [2019-10-02 14:13:20,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:20,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:20,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:20,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:20,250 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-02 14:13:20,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:20,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:20,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:20,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:20,252 INFO L87 Difference]: Start difference. First operand 539 states and 730 transitions. Second operand 3 states. [2019-10-02 14:13:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:20,302 INFO L93 Difference]: Finished difference Result 1091 states and 1522 transitions. [2019-10-02 14:13:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:20,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 14:13:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:20,310 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 14:13:20,311 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 14:13:20,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 14:13:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-10-02 14:13:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-10-02 14:13:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 862 transitions. [2019-10-02 14:13:20,359 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 862 transitions. Word has length 170 [2019-10-02 14:13:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:20,360 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 862 transitions. [2019-10-02 14:13:20,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 862 transitions. [2019-10-02 14:13:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 14:13:20,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:20,371 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] [2019-10-02 14:13:20,372 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1471474153, now seen corresponding path program 1 times [2019-10-02 14:13:20,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:20,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:20,637 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-02 14:13:20,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:20,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:20,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:20,640 INFO L87 Difference]: Start difference. First operand 616 states and 862 transitions. Second operand 3 states. [2019-10-02 14:13:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:20,698 INFO L93 Difference]: Finished difference Result 1316 states and 1908 transitions. [2019-10-02 14:13:20,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:20,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 14:13:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:20,711 INFO L225 Difference]: With dead ends: 1316 [2019-10-02 14:13:20,711 INFO L226 Difference]: Without dead ends: 765 [2019-10-02 14:13:20,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-02 14:13:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 764. [2019-10-02 14:13:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-10-02 14:13:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1114 transitions. [2019-10-02 14:13:20,774 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1114 transitions. Word has length 171 [2019-10-02 14:13:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:20,775 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1114 transitions. [2019-10-02 14:13:20,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1114 transitions. [2019-10-02 14:13:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:13:20,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:20,784 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] [2019-10-02 14:13:20,785 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:20,785 INFO L82 PathProgramCache]: Analyzing trace with hash -388772307, now seen corresponding path program 1 times [2019-10-02 14:13:20,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:20,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:20,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:21,079 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-02 14:13:21,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:21,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:21,081 INFO L87 Difference]: Start difference. First operand 764 states and 1114 transitions. Second operand 3 states. [2019-10-02 14:13:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:21,137 INFO L93 Difference]: Finished difference Result 1748 states and 2644 transitions. [2019-10-02 14:13:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:21,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 14:13:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:21,147 INFO L225 Difference]: With dead ends: 1748 [2019-10-02 14:13:21,148 INFO L226 Difference]: Without dead ends: 1049 [2019-10-02 14:13:21,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-10-02 14:13:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1048. [2019-10-02 14:13:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-02 14:13:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1594 transitions. [2019-10-02 14:13:21,213 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1594 transitions. Word has length 172 [2019-10-02 14:13:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:21,214 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1594 transitions. [2019-10-02 14:13:21,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1594 transitions. [2019-10-02 14:13:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 14:13:21,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:21,221 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] [2019-10-02 14:13:21,221 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1194793961, now seen corresponding path program 1 times [2019-10-02 14:13:21,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:21,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:21,410 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-02 14:13:21,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:21,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:21,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:21,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:21,412 INFO L87 Difference]: Start difference. First operand 1048 states and 1594 transitions. Second operand 3 states. [2019-10-02 14:13:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:21,472 INFO L93 Difference]: Finished difference Result 1404 states and 2062 transitions. [2019-10-02 14:13:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:21,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 14:13:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:21,483 INFO L225 Difference]: With dead ends: 1404 [2019-10-02 14:13:21,484 INFO L226 Difference]: Without dead ends: 1141 [2019-10-02 14:13:21,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-10-02 14:13:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2019-10-02 14:13:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2019-10-02 14:13:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1717 transitions. [2019-10-02 14:13:21,560 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1717 transitions. Word has length 175 [2019-10-02 14:13:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:21,561 INFO L475 AbstractCegarLoop]: Abstraction has 1141 states and 1717 transitions. [2019-10-02 14:13:21,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1717 transitions. [2019-10-02 14:13:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-02 14:13:21,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:21,577 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:21,578 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash 895322575, now seen corresponding path program 1 times [2019-10-02 14:13:21,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:21,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 14:13:22,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:22,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:13:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:23,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 3523 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:13:23,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 14:13:23,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:13:23,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:13:23,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:13:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:13:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:13:23,584 INFO L87 Difference]: Start difference. First operand 1141 states and 1717 transitions. Second operand 29 states. [2019-10-02 14:13:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:51,044 INFO L93 Difference]: Finished difference Result 4732 states and 7001 transitions. [2019-10-02 14:13:51,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-10-02 14:13:51,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 318 [2019-10-02 14:13:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:51,070 INFO L225 Difference]: With dead ends: 4732 [2019-10-02 14:13:51,071 INFO L226 Difference]: Without dead ends: 3621 [2019-10-02 14:13:51,082 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5969 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1453, Invalid=17453, Unknown=0, NotChecked=0, Total=18906 [2019-10-02 14:13:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-10-02 14:13:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3271. [2019-10-02 14:13:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3271 states. [2019-10-02 14:13:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4852 transitions. [2019-10-02 14:13:51,312 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4852 transitions. Word has length 318 [2019-10-02 14:13:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:51,313 INFO L475 AbstractCegarLoop]: Abstraction has 3271 states and 4852 transitions. [2019-10-02 14:13:51,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:13:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4852 transitions. [2019-10-02 14:13:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 14:13:51,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:51,332 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:51,333 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:51,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1608509808, now seen corresponding path program 1 times [2019-10-02 14:13:51,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:51,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:13:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:13:51,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:13:51,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:13:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:13:51,705 INFO L87 Difference]: Start difference. First operand 3271 states and 4852 transitions. Second operand 5 states. [2019-10-02 14:13:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:51,850 INFO L93 Difference]: Finished difference Result 4671 states and 6667 transitions. [2019-10-02 14:13:51,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:13:51,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 323 [2019-10-02 14:13:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:51,873 INFO L225 Difference]: With dead ends: 4671 [2019-10-02 14:13:51,873 INFO L226 Difference]: Without dead ends: 3192 [2019-10-02 14:13:51,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:13:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2019-10-02 14:13:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3178. [2019-10-02 14:13:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-10-02 14:13:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4713 transitions. [2019-10-02 14:13:52,071 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4713 transitions. Word has length 323 [2019-10-02 14:13:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:52,074 INFO L475 AbstractCegarLoop]: Abstraction has 3178 states and 4713 transitions. [2019-10-02 14:13:52,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:13:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4713 transitions. [2019-10-02 14:13:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-02 14:13:52,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:52,105 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:52,105 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1604714373, now seen corresponding path program 1 times [2019-10-02 14:13:52,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:52,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 14:13:52,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:52,673 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:13:52,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:53,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 3525 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:13:53,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 14:13:53,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:13:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-10-02 14:13:53,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:13:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:13:53,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:13:53,725 INFO L87 Difference]: Start difference. First operand 3178 states and 4713 transitions. Second operand 21 states. [2019-10-02 14:13:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:55,647 INFO L93 Difference]: Finished difference Result 6453 states and 9610 transitions. [2019-10-02 14:13:55,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:13:55,647 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 320 [2019-10-02 14:13:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:55,667 INFO L225 Difference]: With dead ends: 6453 [2019-10-02 14:13:55,668 INFO L226 Difference]: Without dead ends: 3211 [2019-10-02 14:13:55,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:13:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2019-10-02 14:13:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 3141. [2019-10-02 14:13:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2019-10-02 14:13:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4639 transitions. [2019-10-02 14:13:55,842 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4639 transitions. Word has length 320 [2019-10-02 14:13:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:55,843 INFO L475 AbstractCegarLoop]: Abstraction has 3141 states and 4639 transitions. [2019-10-02 14:13:55,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:13:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4639 transitions. [2019-10-02 14:13:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-02 14:13:55,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:55,862 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:55,862 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -760648431, now seen corresponding path program 1 times [2019-10-02 14:13:55,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:55,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:55,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:55,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 14:13:56,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:56,247 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:13:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:56,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 3524 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:13:56,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-02 14:13:57,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:13:57,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 14:13:57,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:13:57,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:13:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:13:57,199 INFO L87 Difference]: Start difference. First operand 3141 states and 4639 transitions. Second operand 18 states. [2019-10-02 14:13:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:59,659 INFO L93 Difference]: Finished difference Result 6300 states and 9318 transitions. [2019-10-02 14:13:59,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:13:59,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 321 [2019-10-02 14:13:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:59,678 INFO L225 Difference]: With dead ends: 6300 [2019-10-02 14:13:59,679 INFO L226 Difference]: Without dead ends: 3182 [2019-10-02 14:13:59,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:13:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2019-10-02 14:13:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3145. [2019-10-02 14:13:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-10-02 14:13:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4630 transitions. [2019-10-02 14:13:59,863 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4630 transitions. Word has length 321 [2019-10-02 14:13:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:59,864 INFO L475 AbstractCegarLoop]: Abstraction has 3145 states and 4630 transitions. [2019-10-02 14:13:59,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:13:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4630 transitions. [2019-10-02 14:13:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 14:13:59,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:59,883 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:59,884 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1701910355, now seen corresponding path program 1 times [2019-10-02 14:13:59,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:59,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 14:14:00,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:00,314 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:00,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 3527 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:14:00,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:14:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:14:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:14:01,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:14:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:14:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:14:01,519 INFO L87 Difference]: Start difference. First operand 3145 states and 4630 transitions. Second operand 25 states. [2019-10-02 14:14:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:25,968 INFO L93 Difference]: Finished difference Result 6724 states and 9843 transitions. [2019-10-02 14:14:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-02 14:14:25,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 322 [2019-10-02 14:14:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:25,990 INFO L225 Difference]: With dead ends: 6724 [2019-10-02 14:14:25,990 INFO L226 Difference]: Without dead ends: 3635 [2019-10-02 14:14:26,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4707 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1278, Invalid=13974, Unknown=0, NotChecked=0, Total=15252 [2019-10-02 14:14:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2019-10-02 14:14:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3145. [2019-10-02 14:14:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-10-02 14:14:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4629 transitions. [2019-10-02 14:14:26,150 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4629 transitions. Word has length 322 [2019-10-02 14:14:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:26,150 INFO L475 AbstractCegarLoop]: Abstraction has 3145 states and 4629 transitions. [2019-10-02 14:14:26,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:14:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4629 transitions. [2019-10-02 14:14:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 14:14:26,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:26,167 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:26,167 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1824003748, now seen corresponding path program 1 times [2019-10-02 14:14:26,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:26,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:26,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 14:14:26,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:26,402 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:26,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:27,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 3528 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:14:27,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:14:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:14:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 14:14:27,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:14:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:14:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:14:27,239 INFO L87 Difference]: Start difference. First operand 3145 states and 4629 transitions. Second operand 10 states. [2019-10-02 14:14:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:31,421 INFO L93 Difference]: Finished difference Result 8947 states and 13154 transitions. [2019-10-02 14:14:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:14:31,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 323 [2019-10-02 14:14:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:31,460 INFO L225 Difference]: With dead ends: 8947 [2019-10-02 14:14:31,460 INFO L226 Difference]: Without dead ends: 5878 [2019-10-02 14:14:31,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:14:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-10-02 14:14:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5552. [2019-10-02 14:14:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2019-10-02 14:14:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 8161 transitions. [2019-10-02 14:14:31,741 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 8161 transitions. Word has length 323 [2019-10-02 14:14:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:31,743 INFO L475 AbstractCegarLoop]: Abstraction has 5552 states and 8161 transitions. [2019-10-02 14:14:31,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:14:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 8161 transitions. [2019-10-02 14:14:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 14:14:31,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:31,771 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:31,771 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash -128785514, now seen corresponding path program 1 times [2019-10-02 14:14:31,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:31,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 14:14:32,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:32,117 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:32,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:32,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 3530 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:14:32,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:14:32,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:14:32,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 14:14:32,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:14:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:14:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:14:32,987 INFO L87 Difference]: Start difference. First operand 5552 states and 8161 transitions. Second operand 14 states. [2019-10-02 14:14:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:42,121 INFO L93 Difference]: Finished difference Result 16974 states and 24643 transitions. [2019-10-02 14:14:42,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:14:42,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 326 [2019-10-02 14:14:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:42,170 INFO L225 Difference]: With dead ends: 16974 [2019-10-02 14:14:42,171 INFO L226 Difference]: Without dead ends: 11486 [2019-10-02 14:14:42,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:14:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2019-10-02 14:14:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 10702. [2019-10-02 14:14:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2019-10-02 14:14:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 15402 transitions. [2019-10-02 14:14:42,710 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 15402 transitions. Word has length 326 [2019-10-02 14:14:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:42,710 INFO L475 AbstractCegarLoop]: Abstraction has 10702 states and 15402 transitions. [2019-10-02 14:14:42,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:14:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 15402 transitions. [2019-10-02 14:14:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 14:14:42,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:42,766 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:42,766 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash 698101659, now seen corresponding path program 1 times [2019-10-02 14:14:42,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:42,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:42,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:42,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:42,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 14:14:43,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:43,480 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:14:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:44,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 3532 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:14:44,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 14:14:44,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:14:44,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 4] total 26 [2019-10-02 14:14:44,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:14:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:14:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:14:44,246 INFO L87 Difference]: Start difference. First operand 10702 states and 15402 transitions. Second operand 26 states. [2019-10-02 14:14:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:45,390 INFO L93 Difference]: Finished difference Result 19481 states and 28600 transitions. [2019-10-02 14:14:45,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:14:45,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 328 [2019-10-02 14:14:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:45,434 INFO L225 Difference]: With dead ends: 19481 [2019-10-02 14:14:45,435 INFO L226 Difference]: Without dead ends: 8925 [2019-10-02 14:14:45,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:14:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8925 states. [2019-10-02 14:14:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8925 to 8863. [2019-10-02 14:14:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8863 states. [2019-10-02 14:14:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8863 states to 8863 states and 12826 transitions. [2019-10-02 14:14:45,936 INFO L78 Accepts]: Start accepts. Automaton has 8863 states and 12826 transitions. Word has length 328 [2019-10-02 14:14:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:45,937 INFO L475 AbstractCegarLoop]: Abstraction has 8863 states and 12826 transitions. [2019-10-02 14:14:45,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:14:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8863 states and 12826 transitions. [2019-10-02 14:14:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:14:45,972 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:45,972 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:45,973 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1296494576, now seen corresponding path program 1 times [2019-10-02 14:14:45,973 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:45,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:45,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:45,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:45,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:14:46,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:46,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:46,369 INFO L87 Difference]: Start difference. First operand 8863 states and 12826 transitions. Second operand 3 states. [2019-10-02 14:14:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:46,704 INFO L93 Difference]: Finished difference Result 19235 states and 28428 transitions. [2019-10-02 14:14:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:46,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-02 14:14:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:46,750 INFO L225 Difference]: With dead ends: 19235 [2019-10-02 14:14:46,750 INFO L226 Difference]: Without dead ends: 10504 [2019-10-02 14:14:46,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10504 states. [2019-10-02 14:14:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10504 to 10501. [2019-10-02 14:14:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10501 states. [2019-10-02 14:14:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15711 transitions. [2019-10-02 14:14:47,303 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15711 transitions. Word has length 332 [2019-10-02 14:14:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:47,304 INFO L475 AbstractCegarLoop]: Abstraction has 10501 states and 15711 transitions. [2019-10-02 14:14:47,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15711 transitions. [2019-10-02 14:14:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 14:14:47,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:47,335 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:47,335 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash -652543020, now seen corresponding path program 1 times [2019-10-02 14:14:47,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:47,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:47,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:14:47,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:47,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:47,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:47,514 INFO L87 Difference]: Start difference. First operand 10501 states and 15711 transitions. Second operand 3 states. [2019-10-02 14:14:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:47,864 INFO L93 Difference]: Finished difference Result 24179 states and 37161 transitions. [2019-10-02 14:14:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:47,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-10-02 14:14:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:47,914 INFO L225 Difference]: With dead ends: 24179 [2019-10-02 14:14:47,914 INFO L226 Difference]: Without dead ends: 13818 [2019-10-02 14:14:47,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13818 states. [2019-10-02 14:14:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13818 to 13815. [2019-10-02 14:14:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13815 states. [2019-10-02 14:14:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13815 states to 13815 states and 21520 transitions. [2019-10-02 14:14:48,762 INFO L78 Accepts]: Start accepts. Automaton has 13815 states and 21520 transitions. Word has length 333 [2019-10-02 14:14:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:48,763 INFO L475 AbstractCegarLoop]: Abstraction has 13815 states and 21520 transitions. [2019-10-02 14:14:48,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13815 states and 21520 transitions. [2019-10-02 14:14:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:14:48,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:48,807 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:48,807 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 498425812, now seen corresponding path program 1 times [2019-10-02 14:14:48,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:48,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:14:48,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:48,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:48,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:48,965 INFO L87 Difference]: Start difference. First operand 13815 states and 21520 transitions. Second operand 3 states. [2019-10-02 14:14:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:49,629 INFO L93 Difference]: Finished difference Result 33633 states and 53811 transitions. [2019-10-02 14:14:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:49,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-02 14:14:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:49,704 INFO L225 Difference]: With dead ends: 33633 [2019-10-02 14:14:49,704 INFO L226 Difference]: Without dead ends: 19964 [2019-10-02 14:14:49,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19964 states. [2019-10-02 14:14:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19964 to 19961. [2019-10-02 14:14:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19961 states. [2019-10-02 14:14:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19961 states to 19961 states and 32273 transitions. [2019-10-02 14:14:51,695 INFO L78 Accepts]: Start accepts. Automaton has 19961 states and 32273 transitions. Word has length 332 [2019-10-02 14:14:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:51,695 INFO L475 AbstractCegarLoop]: Abstraction has 19961 states and 32273 transitions. [2019-10-02 14:14:51,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19961 states and 32273 transitions. [2019-10-02 14:14:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 14:14:51,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:51,762 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:51,762 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 486561782, now seen corresponding path program 1 times [2019-10-02 14:14:51,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:51,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:51,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:14:51,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:51,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:51,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:51,959 INFO L87 Difference]: Start difference. First operand 19961 states and 32273 transitions. Second operand 3 states. [2019-10-02 14:14:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:53,111 INFO L93 Difference]: Finished difference Result 52257 states and 86256 transitions. [2019-10-02 14:14:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:53,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-02 14:14:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:53,257 INFO L225 Difference]: With dead ends: 52257 [2019-10-02 14:14:53,257 INFO L226 Difference]: Without dead ends: 32446 [2019-10-02 14:14:53,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32446 states. [2019-10-02 14:14:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32446 to 32443. [2019-10-02 14:14:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32443 states. [2019-10-02 14:14:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32443 states to 32443 states and 53778 transitions. [2019-10-02 14:14:56,376 INFO L78 Accepts]: Start accepts. Automaton has 32443 states and 53778 transitions. Word has length 365 [2019-10-02 14:14:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:56,376 INFO L475 AbstractCegarLoop]: Abstraction has 32443 states and 53778 transitions. [2019-10-02 14:14:56,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 32443 states and 53778 transitions. [2019-10-02 14:14:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 14:14:56,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:56,473 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:56,473 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:56,474 INFO L82 PathProgramCache]: Analyzing trace with hash -130832880, now seen corresponding path program 1 times [2019-10-02 14:14:56,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:56,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:56,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:14:56,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:56,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:56,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:56,675 INFO L87 Difference]: Start difference. First operand 32443 states and 53778 transitions. Second operand 3 states. [2019-10-02 14:14:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:58,649 INFO L93 Difference]: Finished difference Result 87777 states and 146922 transitions. [2019-10-02 14:14:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:58,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-02 14:14:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:58,839 INFO L225 Difference]: With dead ends: 87777 [2019-10-02 14:14:58,839 INFO L226 Difference]: Without dead ends: 55492 [2019-10-02 14:14:58,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55492 states. [2019-10-02 14:15:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55492 to 55489. [2019-10-02 14:15:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55489 states. [2019-10-02 14:15:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55489 states to 55489 states and 92567 transitions. [2019-10-02 14:15:01,657 INFO L78 Accepts]: Start accepts. Automaton has 55489 states and 92567 transitions. Word has length 336 [2019-10-02 14:15:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:01,657 INFO L475 AbstractCegarLoop]: Abstraction has 55489 states and 92567 transitions. [2019-10-02 14:15:01,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55489 states and 92567 transitions. [2019-10-02 14:15:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-10-02 14:15:01,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:01,842 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:01,842 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash -917807208, now seen corresponding path program 1 times [2019-10-02 14:15:01,842 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:01,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:15:02,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:02,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:02,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:02,061 INFO L87 Difference]: Start difference. First operand 55489 states and 92567 transitions. Second operand 3 states. [2019-10-02 14:15:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:07,719 INFO L93 Difference]: Finished difference Result 154591 states and 260196 transitions. [2019-10-02 14:15:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 367 [2019-10-02 14:15:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:08,010 INFO L225 Difference]: With dead ends: 154591 [2019-10-02 14:15:08,010 INFO L226 Difference]: Without dead ends: 99270 [2019-10-02 14:15:08,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99270 states. [2019-10-02 14:15:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99270 to 99267. [2019-10-02 14:15:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99267 states. [2019-10-02 14:15:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99267 states to 99267 states and 166296 transitions. [2019-10-02 14:15:12,743 INFO L78 Accepts]: Start accepts. Automaton has 99267 states and 166296 transitions. Word has length 367 [2019-10-02 14:15:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:12,743 INFO L475 AbstractCegarLoop]: Abstraction has 99267 states and 166296 transitions. [2019-10-02 14:15:12,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 99267 states and 166296 transitions. [2019-10-02 14:15:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-02 14:15:13,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:13,087 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:13,087 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1256045804, now seen corresponding path program 1 times [2019-10-02 14:15:13,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:13,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:13,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:15:13,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:13,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:13,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:13,294 INFO L87 Difference]: Start difference. First operand 99267 states and 166296 transitions. Second operand 3 states. [2019-10-02 14:15:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:21,415 INFO L93 Difference]: Finished difference Result 188741 states and 313368 transitions. [2019-10-02 14:15:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:21,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-10-02 14:15:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:21,947 INFO L225 Difference]: With dead ends: 188741 [2019-10-02 14:15:21,947 INFO L226 Difference]: Without dead ends: 182202 [2019-10-02 14:15:22,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:22,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182202 states. [2019-10-02 14:15:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182202 to 182199. [2019-10-02 14:15:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182199 states. [2019-10-02 14:15:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182199 states to 182199 states and 301448 transitions. [2019-10-02 14:15:33,540 INFO L78 Accepts]: Start accepts. Automaton has 182199 states and 301448 transitions. Word has length 366 [2019-10-02 14:15:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:33,540 INFO L475 AbstractCegarLoop]: Abstraction has 182199 states and 301448 transitions. [2019-10-02 14:15:33,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 182199 states and 301448 transitions. [2019-10-02 14:15:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-02 14:15:34,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:34,236 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:34,236 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1640446008, now seen corresponding path program 1 times [2019-10-02 14:15:34,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:34,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:34,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 14:15:34,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:34,569 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:35,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 3685 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:15:35,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 14:15:35,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:15:35,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 14:15:35,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:15:35,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:15:35,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:15:35,526 INFO L87 Difference]: Start difference. First operand 182199 states and 301448 transitions. Second operand 15 states. [2019-10-02 14:16:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:17,825 INFO L93 Difference]: Finished difference Result 556581 states and 934849 transitions. [2019-10-02 14:16:17,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 14:16:17,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 369 [2019-10-02 14:16:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:20,017 INFO L225 Difference]: With dead ends: 556581 [2019-10-02 14:16:20,017 INFO L226 Difference]: Without dead ends: 550005 [2019-10-02 14:16:20,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=478, Invalid=2714, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:16:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550005 states. [2019-10-02 14:16:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550005 to 375779. [2019-10-02 14:16:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375779 states. [2019-10-02 14:16:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375779 states to 375779 states and 629533 transitions. [2019-10-02 14:16:52,314 INFO L78 Accepts]: Start accepts. Automaton has 375779 states and 629533 transitions. Word has length 369 [2019-10-02 14:16:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:52,315 INFO L475 AbstractCegarLoop]: Abstraction has 375779 states and 629533 transitions. [2019-10-02 14:16:52,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:16:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 375779 states and 629533 transitions. [2019-10-02 14:17:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-10-02 14:17:00,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:17:00,720 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:17:00,720 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:17:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:17:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1957755030, now seen corresponding path program 1 times [2019-10-02 14:17:00,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:17:00,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:17:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:00,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:17:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 14:17:00,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:17:00,897 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:17:01,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:17:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:17:01,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 3637 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:17:01,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:17:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:17:01,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:17:01,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 14:17:01,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:17:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:17:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:17:01,705 INFO L87 Difference]: Start difference. First operand 375779 states and 629533 transitions. Second operand 12 states. [2019-10-02 14:17:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:24,673 INFO L93 Difference]: Finished difference Result 560058 states and 938552 transitions. [2019-10-02 14:17:24,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:17:24,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 355 [2019-10-02 14:17:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:25,769 INFO L225 Difference]: With dead ends: 560058 [2019-10-02 14:17:25,770 INFO L226 Difference]: Without dead ends: 372215 [2019-10-02 14:17:26,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:17:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372215 states. [2019-10-02 14:17:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372215 to 372193. [2019-10-02 14:17:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372193 states. [2019-10-02 14:17:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372193 states to 372193 states and 623796 transitions. [2019-10-02 14:17:58,026 INFO L78 Accepts]: Start accepts. Automaton has 372193 states and 623796 transitions. Word has length 355 [2019-10-02 14:17:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:17:58,026 INFO L475 AbstractCegarLoop]: Abstraction has 372193 states and 623796 transitions. [2019-10-02 14:17:58,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:17:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 372193 states and 623796 transitions. [2019-10-02 14:18:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-02 14:18:08,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:18:08,033 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:18:08,033 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:18:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:18:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 233328869, now seen corresponding path program 1 times [2019-10-02 14:18:08,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:18:08,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:18:08,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:08,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:08,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 14:18:08,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:18:08,256 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:18:08,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:08,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 3595 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:18:08,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:18:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 14:18:09,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:18:09,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-02 14:18:09,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:18:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:18:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:18:09,288 INFO L87 Difference]: Start difference. First operand 372193 states and 623796 transitions. Second operand 20 states. [2019-10-02 14:18:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:18:32,721 INFO L93 Difference]: Finished difference Result 382748 states and 637557 transitions. [2019-10-02 14:18:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:18:32,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 346 [2019-10-02 14:18:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:18:34,403 INFO L225 Difference]: With dead ends: 382748 [2019-10-02 14:18:34,403 INFO L226 Difference]: Without dead ends: 373565 [2019-10-02 14:18:34,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:18:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373565 states. [2019-10-02 14:19:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373565 to 372169. [2019-10-02 14:19:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372169 states. [2019-10-02 14:19:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372169 states to 372169 states and 623751 transitions. [2019-10-02 14:19:05,606 INFO L78 Accepts]: Start accepts. Automaton has 372169 states and 623751 transitions. Word has length 346 [2019-10-02 14:19:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:05,606 INFO L475 AbstractCegarLoop]: Abstraction has 372169 states and 623751 transitions. [2019-10-02 14:19:05,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:19:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 372169 states and 623751 transitions. [2019-10-02 14:19:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 14:19:07,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:07,324 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:07,324 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash 367421608, now seen corresponding path program 1 times [2019-10-02 14:19:07,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:07,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:07,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:19:07,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:19:07,521 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:19:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:08,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 3680 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:19:08,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:19:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 14:19:08,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:19:08,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [5] total 22 [2019-10-02 14:19:08,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 14:19:08,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 14:19:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:19:08,879 INFO L87 Difference]: Start difference. First operand 372169 states and 623751 transitions. Second operand 22 states. [2019-10-02 14:19:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:19:39,820 INFO L93 Difference]: Finished difference Result 382869 states and 636846 transitions. [2019-10-02 14:19:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:19:39,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 365 [2019-10-02 14:19:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:19:40,945 INFO L225 Difference]: With dead ends: 382869 [2019-10-02 14:19:40,945 INFO L226 Difference]: Without dead ends: 369422 [2019-10-02 14:19:41,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1962, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 14:19:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369422 states. [2019-10-02 14:20:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369422 to 368295. [2019-10-02 14:20:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368295 states. [2019-10-02 14:20:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368295 states to 368295 states and 618211 transitions. [2019-10-02 14:20:20,608 INFO L78 Accepts]: Start accepts. Automaton has 368295 states and 618211 transitions. Word has length 365 [2019-10-02 14:20:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:20,608 INFO L475 AbstractCegarLoop]: Abstraction has 368295 states and 618211 transitions. [2019-10-02 14:20:20,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 14:20:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 368295 states and 618211 transitions. [2019-10-02 14:20:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-02 14:20:22,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:22,422 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:22,423 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1656965051, now seen corresponding path program 1 times [2019-10-02 14:20:22,423 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:22,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 14:20:22,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:20:22,775 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:20:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:23,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 3619 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:20:23,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:20:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 14:20:24,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:20:24,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-02 14:20:24,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:20:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:20:24,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:20:24,851 INFO L87 Difference]: Start difference. First operand 368295 states and 618211 transitions. Second operand 34 states. [2019-10-02 14:21:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:21:17,300 INFO L93 Difference]: Finished difference Result 376594 states and 628772 transitions. [2019-10-02 14:21:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-10-02 14:21:17,301 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 349 [2019-10-02 14:21:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:21:19,052 INFO L225 Difference]: With dead ends: 376594 [2019-10-02 14:21:19,052 INFO L226 Difference]: Without dead ends: 366030 [2019-10-02 14:21:19,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6072 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1269, Invalid=17637, Unknown=0, NotChecked=0, Total=18906 [2019-10-02 14:21:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366030 states. [2019-10-02 14:21:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366030 to 360143. [2019-10-02 14:21:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360143 states. [2019-10-02 14:21:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360143 states to 360143 states and 607721 transitions. [2019-10-02 14:21:51,603 INFO L78 Accepts]: Start accepts. Automaton has 360143 states and 607721 transitions. Word has length 349 [2019-10-02 14:21:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:21:51,603 INFO L475 AbstractCegarLoop]: Abstraction has 360143 states and 607721 transitions. [2019-10-02 14:21:51,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:21:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 360143 states and 607721 transitions. [2019-10-02 14:22:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-02 14:22:03,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:22:03,427 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:22:03,427 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:22:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:22:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash -156738776, now seen corresponding path program 1 times [2019-10-02 14:22:03,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:22:03,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:22:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 14:22:03,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:22:03,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:22:03,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:22:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:22:03,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:22:03,654 INFO L87 Difference]: Start difference. First operand 360143 states and 607721 transitions. Second operand 10 states. [2019-10-02 14:22:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:22:20,706 INFO L93 Difference]: Finished difference Result 364532 states and 613237 transitions. [2019-10-02 14:22:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:22:20,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 349 [2019-10-02 14:22:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:22:21,916 INFO L225 Difference]: With dead ends: 364532 [2019-10-02 14:22:21,916 INFO L226 Difference]: Without dead ends: 360143 [2019-10-02 14:22:22,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:22:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360143 states. [2019-10-02 14:22:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360143 to 360143. [2019-10-02 14:22:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360143 states. [2019-10-02 14:22:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360143 states to 360143 states and 607697 transitions. [2019-10-02 14:22:56,236 INFO L78 Accepts]: Start accepts. Automaton has 360143 states and 607697 transitions. Word has length 349 [2019-10-02 14:22:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:22:56,236 INFO L475 AbstractCegarLoop]: Abstraction has 360143 states and 607697 transitions. [2019-10-02 14:22:56,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:22:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 360143 states and 607697 transitions. [2019-10-02 14:22:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-10-02 14:22:57,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:22:57,993 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:22:57,993 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:22:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:22:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 239470643, now seen corresponding path program 1 times [2019-10-02 14:22:57,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:22:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:22:57,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:57,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:57,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:22:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 14:22:58,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:22:58,269 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:22:58,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:22:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:22:58,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 3638 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:22:58,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:23:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:23:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:23:00,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 14:23:00,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:23:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:23:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:23:00,101 INFO L87 Difference]: Start difference. First operand 360143 states and 607697 transitions. Second operand 19 states.