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_spec8_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:45:28,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:45:28,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:45:28,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:45:28,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:45:28,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:45:28,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:45:28,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:45:28,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:45:29,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:45:29,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:45:29,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:45:29,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:45:29,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:45:29,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:45:29,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:45:29,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:45:29,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:45:29,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:45:29,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:45:29,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:45:29,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:45:29,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:45:29,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:45:29,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:45:29,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:45:29,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:45:29,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:45:29,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:45:29,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:45:29,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:45:29,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:45:29,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:45:29,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:45:29,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:45:29,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:45:29,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:45:29,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:45:29,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:45:29,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:45:29,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:45:29,040 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-09-08 05:45:29,062 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:45:29,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:45:29,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:45:29,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:45:29,064 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:45:29,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:45:29,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:45:29,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:45:29,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:45:29,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:45:29,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:45:29,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:45:29,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:45:29,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:45:29,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:45:29,067 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:45:29,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:45:29,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:45:29,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:45:29,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:45:29,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:45:29,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:45:29,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:45:29,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:45:29,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:45:29,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:45:29,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:45:29,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:45:29,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:45:29,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:45:29,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:45:29,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:45:29,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:45:29,123 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:45:29,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product28.cil.c [2019-09-08 05:45:29,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16df5c4d4/1bcf305842084be287eb72e9b1a375fb/FLAG88b1849a5 [2019-09-08 05:45:29,912 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:45:29,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product28.cil.c [2019-09-08 05:45:29,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16df5c4d4/1bcf305842084be287eb72e9b1a375fb/FLAG88b1849a5 [2019-09-08 05:45:30,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16df5c4d4/1bcf305842084be287eb72e9b1a375fb [2019-09-08 05:45:30,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:45:30,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:45:30,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:45:30,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:45:30,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:45:30,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:45:30" (1/1) ... [2019-09-08 05:45:30,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fabccff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:30, skipping insertion in model container [2019-09-08 05:45:30,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:45:30" (1/1) ... [2019-09-08 05:45:30,129 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:45:30,200 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:45:30,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:45:30,995 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:45:31,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:45:31,206 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:45:31,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31 WrapperNode [2019-09-08 05:45:31,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:45:31,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:45:31,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:45:31,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:45:31,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... [2019-09-08 05:45:31,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:45:31,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:45:31,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:45:31,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:45:31,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:45:31,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:45:31,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:45:31,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:45:31,484 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:45:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:45:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:45:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:45:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:45:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:45:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-09-08 05:45:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:45:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:45:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:45:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:45:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:45:31,489 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:45:31,491 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:45:31,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:45:31,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:45:31,492 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:45:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:45:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:45:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:45:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:45:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:45:31,495 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:45:31,495 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:45:31,495 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:45:31,495 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:45:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:45:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:45:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:45:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:45:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:45:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:45:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:45:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:45:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:45:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:45:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:45:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:45:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:45:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:45:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:45:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:45:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:45:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:45:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:45:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:45:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:45:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:45:31,501 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:45:31,501 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:45:31,501 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:45:31,501 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:45:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:45:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:45:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:45:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:45:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:45:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:45:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:45:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:45:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:45:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:45:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:45:31,504 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:45:31,504 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:45:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:45:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:45:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:45:31,506 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:45:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:45:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:45:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:45:31,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:45:31,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:45:31,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:45:31,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:45:31,509 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:45:31,509 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:45:31,509 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:45:31,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:45:31,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:45:31,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:45:31,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:45:31,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:45:31,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:45:31,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:45:31,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:45:31,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:45:31,511 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:45:31,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:45:31,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:45:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:45:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:45:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:45:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:45:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:45:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:45:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:45:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:45:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:45:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:45:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:45:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:45:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:45:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:45:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:45:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:45:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:45:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:45:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:45:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:45:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:45:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:45:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:45:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:45:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:45:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:45:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:45:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:45:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:45:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:45:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:45:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:45:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:45:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:45:31,526 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:45:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:45:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:45:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:45:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:45:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-09-08 05:45:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:45:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:45:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:45:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:45:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:45:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:45:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:45:31,539 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:45:31,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:45:31,541 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:45:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:45:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:45:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:45:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:45:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:45:31,543 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:45:31,544 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:45:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:45:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:45:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:45:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:45:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:45:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:45:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:45:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:45:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:45:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:45:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:45:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:45:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:45:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:45:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:45:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:45:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:45:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:45:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:45:33,791 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:45:33,791 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:45:33,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:45:33 BoogieIcfgContainer [2019-09-08 05:45:33,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:45:33,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:45:33,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:45:33,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:45:33,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:45:30" (1/3) ... [2019-09-08 05:45:33,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c3545c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:45:33, skipping insertion in model container [2019-09-08 05:45:33,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:45:31" (2/3) ... [2019-09-08 05:45:33,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c3545c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:45:33, skipping insertion in model container [2019-09-08 05:45:33,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:45:33" (3/3) ... [2019-09-08 05:45:33,804 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product28.cil.c [2019-09-08 05:45:33,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:45:33,829 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:45:33,847 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:45:33,914 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:45:33,915 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:45:33,915 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:45:33,916 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:45:33,916 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:45:33,916 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:45:33,916 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:45:33,916 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:45:33,916 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:45:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states. [2019-09-08 05:45:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 05:45:34,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:34,003 INFO L399 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-09-08 05:45:34,008 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1787555890, now seen corresponding path program 1 times [2019-09-08 05:45:34,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:34,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:34,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:45:34,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:34,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:45:34,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:45:34,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:45:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:45:34,733 INFO L87 Difference]: Start difference. First operand 513 states. Second operand 2 states. [2019-09-08 05:45:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:34,802 INFO L93 Difference]: Finished difference Result 723 states and 956 transitions. [2019-09-08 05:45:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:45:34,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-09-08 05:45:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:34,827 INFO L225 Difference]: With dead ends: 723 [2019-09-08 05:45:34,827 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 05:45:34,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:45:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 05:45:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2019-09-08 05:45:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-08 05:45:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 615 transitions. [2019-09-08 05:45:34,981 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 615 transitions. Word has length 158 [2019-09-08 05:45:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:34,983 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 615 transitions. [2019-09-08 05:45:34,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:45:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 615 transitions. [2019-09-08 05:45:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 05:45:34,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:34,996 INFO L399 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-09-08 05:45:34,996 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1218576711, now seen corresponding path program 1 times [2019-09-08 05:45:34,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:34,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:34,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:34,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:35,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:45:35,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:35,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:45:35,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:45:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:45:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:35,253 INFO L87 Difference]: Start difference. First operand 462 states and 615 transitions. Second operand 3 states. [2019-09-08 05:45:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:35,298 INFO L93 Difference]: Finished difference Result 706 states and 924 transitions. [2019-09-08 05:45:35,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:45:35,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 05:45:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:35,305 INFO L225 Difference]: With dead ends: 706 [2019-09-08 05:45:35,305 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 05:45:35,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 05:45:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2019-09-08 05:45:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 05:45:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 617 transitions. [2019-09-08 05:45:35,331 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 617 transitions. Word has length 159 [2019-09-08 05:45:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:35,332 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 617 transitions. [2019-09-08 05:45:35,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:45:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2019-09-08 05:45:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:45:35,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:35,336 INFO L399 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] [2019-09-08 05:45:35,336 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1138420005, now seen corresponding path program 1 times [2019-09-08 05:45:35,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:35,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:45:35,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:35,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:45:35,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:45:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:45:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:35,528 INFO L87 Difference]: Start difference. First operand 464 states and 617 transitions. Second operand 3 states. [2019-09-08 05:45:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:35,582 INFO L93 Difference]: Finished difference Result 902 states and 1229 transitions. [2019-09-08 05:45:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:45:35,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 05:45:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:35,592 INFO L225 Difference]: With dead ends: 902 [2019-09-08 05:45:35,593 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 05:45:35,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 05:45:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2019-09-08 05:45:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 05:45:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 683 transitions. [2019-09-08 05:45:35,638 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 683 transitions. Word has length 165 [2019-09-08 05:45:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:35,639 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 683 transitions. [2019-09-08 05:45:35,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:45:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 683 transitions. [2019-09-08 05:45:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:45:35,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:35,646 INFO L399 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] [2019-09-08 05:45:35,646 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash 154755204, now seen corresponding path program 1 times [2019-09-08 05:45:35,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:35,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:35,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:35,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:45:35,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:45:35,853 INFO L223 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-09-08 05:45:35,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:36,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:45:36,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:45:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 05:45:36,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:45:36,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:45:36,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:45:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:45:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:45:36,703 INFO L87 Difference]: Start difference. First operand 502 states and 683 transitions. Second operand 13 states. [2019-09-08 05:45:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:38,213 INFO L93 Difference]: Finished difference Result 986 states and 1356 transitions. [2019-09-08 05:45:38,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:45:38,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 166 [2019-09-08 05:45:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:38,218 INFO L225 Difference]: With dead ends: 986 [2019-09-08 05:45:38,219 INFO L226 Difference]: Without dead ends: 520 [2019-09-08 05:45:38,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:45:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-08 05:45:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2019-09-08 05:45:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 05:45:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 704 transitions. [2019-09-08 05:45:38,246 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 704 transitions. Word has length 166 [2019-09-08 05:45:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:38,247 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 704 transitions. [2019-09-08 05:45:38,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:45:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 704 transitions. [2019-09-08 05:45:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:45:38,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:38,251 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:38,251 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1582339860, now seen corresponding path program 1 times [2019-09-08 05:45:38,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:38,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:38,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:38,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:38,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:45:38,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:45:38,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:45:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:45:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:45:38,469 INFO L87 Difference]: Start difference. First operand 518 states and 704 transitions. Second operand 7 states. [2019-09-08 05:45:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:38,743 INFO L93 Difference]: Finished difference Result 984 states and 1345 transitions. [2019-09-08 05:45:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:45:38,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 168 [2019-09-08 05:45:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:38,748 INFO L225 Difference]: With dead ends: 984 [2019-09-08 05:45:38,748 INFO L226 Difference]: Without dead ends: 532 [2019-09-08 05:45:38,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:45:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-09-08 05:45:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2019-09-08 05:45:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-08 05:45:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 715 transitions. [2019-09-08 05:45:38,779 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 715 transitions. Word has length 168 [2019-09-08 05:45:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:38,779 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 715 transitions. [2019-09-08 05:45:38,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:45:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 715 transitions. [2019-09-08 05:45:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:45:38,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:38,783 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:38,783 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:38,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:38,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1587290759, now seen corresponding path program 2 times [2019-09-08 05:45:38,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:38,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:38,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:38,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:38,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 05:45:39,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:45:39,034 INFO L223 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) [2019-09-08 05:45:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:45:39,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:45:39,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:45:39,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 2535 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:45:39,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:45:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 05:45:39,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:45:39,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 05:45:39,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:45:39,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:45:39,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:45:39,813 INFO L87 Difference]: Start difference. First operand 528 states and 715 transitions. Second operand 15 states. [2019-09-08 05:45:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:50,970 INFO L93 Difference]: Finished difference Result 1949 states and 2707 transitions. [2019-09-08 05:45:50,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 05:45:50,971 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 169 [2019-09-08 05:45:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:50,983 INFO L225 Difference]: With dead ends: 1949 [2019-09-08 05:45:50,983 INFO L226 Difference]: Without dead ends: 1499 [2019-09-08 05:45:50,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:45:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-09-08 05:45:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1487. [2019-09-08 05:45:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-09-08 05:45:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2064 transitions. [2019-09-08 05:45:51,161 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2064 transitions. Word has length 169 [2019-09-08 05:45:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:51,164 INFO L475 AbstractCegarLoop]: Abstraction has 1487 states and 2064 transitions. [2019-09-08 05:45:51,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:45:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2064 transitions. [2019-09-08 05:45:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:45:51,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:51,170 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:51,170 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -927444645, now seen corresponding path program 1 times [2019-09-08 05:45:51,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:51,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:51,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:45:51,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 05:45:51,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:51,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:45:51,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:45:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:45:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:45:51,422 INFO L87 Difference]: Start difference. First operand 1487 states and 2064 transitions. Second operand 11 states. [2019-09-08 05:45:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:51,774 INFO L93 Difference]: Finished difference Result 1995 states and 2717 transitions. [2019-09-08 05:45:51,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:45:51,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 171 [2019-09-08 05:45:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:51,783 INFO L225 Difference]: With dead ends: 1995 [2019-09-08 05:45:51,783 INFO L226 Difference]: Without dead ends: 1290 [2019-09-08 05:45:51,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:45:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-08 05:45:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1288. [2019-09-08 05:45:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-08 05:45:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1806 transitions. [2019-09-08 05:45:51,859 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1806 transitions. Word has length 171 [2019-09-08 05:45:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:51,860 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1806 transitions. [2019-09-08 05:45:51,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:45:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1806 transitions. [2019-09-08 05:45:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:45:51,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:51,866 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:51,866 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1395324644, now seen corresponding path program 1 times [2019-09-08 05:45:51,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:51,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:51,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:45:52,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:45:52,024 INFO L223 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) [2019-09-08 05:45:52,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:45:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:52,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:45:52,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:45:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 05:45:52,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:45:52,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:45:52,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:45:52,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:45:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:45:52,517 INFO L87 Difference]: Start difference. First operand 1288 states and 1806 transitions. Second operand 12 states. [2019-09-08 05:45:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:54,037 INFO L93 Difference]: Finished difference Result 2006 states and 2775 transitions. [2019-09-08 05:45:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:45:54,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 171 [2019-09-08 05:45:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:54,044 INFO L225 Difference]: With dead ends: 2006 [2019-09-08 05:45:54,044 INFO L226 Difference]: Without dead ends: 1019 [2019-09-08 05:45:54,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:45:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-08 05:45:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1011. [2019-09-08 05:45:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-09-08 05:45:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1394 transitions. [2019-09-08 05:45:54,104 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1394 transitions. Word has length 171 [2019-09-08 05:45:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:54,105 INFO L475 AbstractCegarLoop]: Abstraction has 1011 states and 1394 transitions. [2019-09-08 05:45:54,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:45:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1394 transitions. [2019-09-08 05:45:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 05:45:54,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:54,111 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:54,111 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash -170248871, now seen corresponding path program 1 times [2019-09-08 05:45:54,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:54,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:54,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:54,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:45:54,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:54,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:45:54,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:45:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:45:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:45:54,330 INFO L87 Difference]: Start difference. First operand 1011 states and 1394 transitions. Second operand 9 states. [2019-09-08 05:45:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:54,671 INFO L93 Difference]: Finished difference Result 1951 states and 2707 transitions. [2019-09-08 05:45:54,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:45:54,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-09-08 05:45:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:54,678 INFO L225 Difference]: With dead ends: 1951 [2019-09-08 05:45:54,679 INFO L226 Difference]: Without dead ends: 1013 [2019-09-08 05:45:54,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:45:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-08 05:45:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2019-09-08 05:45:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-09-08 05:45:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1393 transitions. [2019-09-08 05:45:54,728 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1393 transitions. Word has length 180 [2019-09-08 05:45:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:54,728 INFO L475 AbstractCegarLoop]: Abstraction has 1011 states and 1393 transitions. [2019-09-08 05:45:54,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:45:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1393 transitions. [2019-09-08 05:45:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 05:45:54,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:54,733 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:54,733 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1819505624, now seen corresponding path program 2 times [2019-09-08 05:45:54,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:54,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:54,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:45:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:45:54,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:45:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:45:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:45:54,896 INFO L87 Difference]: Start difference. First operand 1011 states and 1393 transitions. Second operand 9 states. [2019-09-08 05:45:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:55,262 INFO L93 Difference]: Finished difference Result 1953 states and 2708 transitions. [2019-09-08 05:45:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:45:55,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-09-08 05:45:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:55,269 INFO L225 Difference]: With dead ends: 1953 [2019-09-08 05:45:55,270 INFO L226 Difference]: Without dead ends: 1015 [2019-09-08 05:45:55,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:45:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-08 05:45:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1011. [2019-09-08 05:45:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-09-08 05:45:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1392 transitions. [2019-09-08 05:45:55,335 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1392 transitions. Word has length 181 [2019-09-08 05:45:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:55,336 INFO L475 AbstractCegarLoop]: Abstraction has 1011 states and 1392 transitions. [2019-09-08 05:45:55,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:45:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1392 transitions. [2019-09-08 05:45:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 05:45:55,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:55,341 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:55,342 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1450374612, now seen corresponding path program 1 times [2019-09-08 05:45:55,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:55,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:45:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:45:55,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:55,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:45:55,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:45:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:45:55,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:45:55,770 INFO L87 Difference]: Start difference. First operand 1011 states and 1392 transitions. Second operand 17 states. [2019-09-08 05:45:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:59,728 INFO L93 Difference]: Finished difference Result 2937 states and 4004 transitions. [2019-09-08 05:45:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:45:59,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 182 [2019-09-08 05:45:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:59,745 INFO L225 Difference]: With dead ends: 2937 [2019-09-08 05:45:59,745 INFO L226 Difference]: Without dead ends: 2476 [2019-09-08 05:45:59,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 05:45:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2019-09-08 05:45:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2428. [2019-09-08 05:45:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-09-08 05:45:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3348 transitions. [2019-09-08 05:45:59,917 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3348 transitions. Word has length 182 [2019-09-08 05:45:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:59,918 INFO L475 AbstractCegarLoop]: Abstraction has 2428 states and 3348 transitions. [2019-09-08 05:45:59,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:45:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3348 transitions. [2019-09-08 05:45:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 05:45:59,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:59,929 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:59,929 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1503330933, now seen corresponding path program 1 times [2019-09-08 05:45:59,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:46:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:00,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:46:00,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:46:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:46:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:46:00,153 INFO L87 Difference]: Start difference. First operand 2428 states and 3348 transitions. Second operand 11 states. [2019-09-08 05:46:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:00,555 INFO L93 Difference]: Finished difference Result 3899 states and 5269 transitions. [2019-09-08 05:46:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:46:00,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2019-09-08 05:46:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:00,573 INFO L225 Difference]: With dead ends: 3899 [2019-09-08 05:46:00,573 INFO L226 Difference]: Without dead ends: 2498 [2019-09-08 05:46:00,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:46:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-09-08 05:46:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498. [2019-09-08 05:46:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-09-08 05:46:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3462 transitions. [2019-09-08 05:46:00,705 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3462 transitions. Word has length 183 [2019-09-08 05:46:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:00,706 INFO L475 AbstractCegarLoop]: Abstraction has 2498 states and 3462 transitions. [2019-09-08 05:46:00,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:46:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3462 transitions. [2019-09-08 05:46:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 05:46:00,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:00,718 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:00,718 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1955758531, now seen corresponding path program 1 times [2019-09-08 05:46:00,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:00,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:00,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:00,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:46:00,887 INFO L223 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) [2019-09-08 05:46:00,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:46:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:01,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 2581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:46:01,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:46:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:01,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:46:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 05:46:01,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:46:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:46:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:46:01,347 INFO L87 Difference]: Start difference. First operand 2498 states and 3462 transitions. Second operand 5 states. [2019-09-08 05:46:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:01,481 INFO L93 Difference]: Finished difference Result 3882 states and 5276 transitions. [2019-09-08 05:46:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:46:01,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-08 05:46:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:01,498 INFO L225 Difference]: With dead ends: 3882 [2019-09-08 05:46:01,498 INFO L226 Difference]: Without dead ends: 2560 [2019-09-08 05:46:01,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:46:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2019-09-08 05:46:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2554. [2019-09-08 05:46:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2019-09-08 05:46:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3554 transitions. [2019-09-08 05:46:01,705 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3554 transitions. Word has length 183 [2019-09-08 05:46:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:01,706 INFO L475 AbstractCegarLoop]: Abstraction has 2554 states and 3554 transitions. [2019-09-08 05:46:01,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:46:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3554 transitions. [2019-09-08 05:46:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 05:46:01,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:01,715 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:46:01,716 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1022308928, now seen corresponding path program 1 times [2019-09-08 05:46:01,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:01,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:01,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:01,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:01,839 INFO L87 Difference]: Start difference. First operand 2554 states and 3554 transitions. Second operand 3 states. [2019-09-08 05:46:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:01,924 INFO L93 Difference]: Finished difference Result 5323 states and 7571 transitions. [2019-09-08 05:46:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:01,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-08 05:46:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:01,941 INFO L225 Difference]: With dead ends: 5323 [2019-09-08 05:46:01,942 INFO L226 Difference]: Without dead ends: 2868 [2019-09-08 05:46:01,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-09-08 05:46:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2864. [2019-09-08 05:46:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2019-09-08 05:46:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4117 transitions. [2019-09-08 05:46:02,118 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4117 transitions. Word has length 189 [2019-09-08 05:46:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:02,118 INFO L475 AbstractCegarLoop]: Abstraction has 2864 states and 4117 transitions. [2019-09-08 05:46:02,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4117 transitions. [2019-09-08 05:46:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 05:46:02,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:02,129 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:02,129 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1232323814, now seen corresponding path program 2 times [2019-09-08 05:46:02,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:02,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:02,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:02,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:02,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:46:02,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:46:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:46:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:46:02,337 INFO L87 Difference]: Start difference. First operand 2864 states and 4117 transitions. Second operand 6 states. [2019-09-08 05:46:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:02,447 INFO L93 Difference]: Finished difference Result 5587 states and 8049 transitions. [2019-09-08 05:46:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:46:02,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-09-08 05:46:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:02,469 INFO L225 Difference]: With dead ends: 5587 [2019-09-08 05:46:02,469 INFO L226 Difference]: Without dead ends: 2868 [2019-09-08 05:46:02,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:46:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-09-08 05:46:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2864. [2019-09-08 05:46:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2019-09-08 05:46:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4109 transitions. [2019-09-08 05:46:02,624 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4109 transitions. Word has length 190 [2019-09-08 05:46:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:02,624 INFO L475 AbstractCegarLoop]: Abstraction has 2864 states and 4109 transitions. [2019-09-08 05:46:02,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:46:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4109 transitions. [2019-09-08 05:46:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 05:46:02,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:02,635 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:46:02,635 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash -433084183, now seen corresponding path program 1 times [2019-09-08 05:46:02,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:02,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:02,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:46:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:02,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:02,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:02,769 INFO L87 Difference]: Start difference. First operand 2864 states and 4109 transitions. Second operand 3 states. [2019-09-08 05:46:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:02,914 INFO L93 Difference]: Finished difference Result 6205 states and 9163 transitions. [2019-09-08 05:46:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:02,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-09-08 05:46:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:02,939 INFO L225 Difference]: With dead ends: 6205 [2019-09-08 05:46:02,939 INFO L226 Difference]: Without dead ends: 3446 [2019-09-08 05:46:02,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2019-09-08 05:46:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3442. [2019-09-08 05:46:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-09-08 05:46:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5154 transitions. [2019-09-08 05:46:03,154 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5154 transitions. Word has length 190 [2019-09-08 05:46:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:03,154 INFO L475 AbstractCegarLoop]: Abstraction has 3442 states and 5154 transitions. [2019-09-08 05:46:03,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5154 transitions. [2019-09-08 05:46:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:46:03,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:03,174 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:46:03,174 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:03,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1257602242, now seen corresponding path program 1 times [2019-09-08 05:46:03,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:03,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:03,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:03,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:03,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:03,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:03,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:03,347 INFO L87 Difference]: Start difference. First operand 3442 states and 5154 transitions. Second operand 3 states. [2019-09-08 05:46:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:03,514 INFO L93 Difference]: Finished difference Result 7884 states and 12193 transitions. [2019-09-08 05:46:03,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:03,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-08 05:46:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:03,542 INFO L225 Difference]: With dead ends: 7884 [2019-09-08 05:46:03,543 INFO L226 Difference]: Without dead ends: 4554 [2019-09-08 05:46:03,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-09-08 05:46:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4550. [2019-09-08 05:46:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-09-08 05:46:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 7133 transitions. [2019-09-08 05:46:03,813 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 7133 transitions. Word has length 191 [2019-09-08 05:46:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:03,814 INFO L475 AbstractCegarLoop]: Abstraction has 4550 states and 7133 transitions. [2019-09-08 05:46:03,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 7133 transitions. [2019-09-08 05:46:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 05:46:03,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:03,834 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:46:03,835 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 114025065, now seen corresponding path program 1 times [2019-09-08 05:46:03,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:03,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:03,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:03,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:03,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:03,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:03,970 INFO L87 Difference]: Start difference. First operand 4550 states and 7133 transitions. Second operand 3 states. [2019-09-08 05:46:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:04,266 INFO L93 Difference]: Finished difference Result 11099 states and 17939 transitions. [2019-09-08 05:46:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:04,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 05:46:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:04,306 INFO L225 Difference]: With dead ends: 11099 [2019-09-08 05:46:04,306 INFO L226 Difference]: Without dead ends: 6670 [2019-09-08 05:46:04,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2019-09-08 05:46:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6666. [2019-09-08 05:46:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-09-08 05:46:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 10880 transitions. [2019-09-08 05:46:04,642 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 10880 transitions. Word has length 192 [2019-09-08 05:46:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:04,643 INFO L475 AbstractCegarLoop]: Abstraction has 6666 states and 10880 transitions. [2019-09-08 05:46:04,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 10880 transitions. [2019-09-08 05:46:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 05:46:04,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:04,675 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:46:04,675 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash 897525570, now seen corresponding path program 1 times [2019-09-08 05:46:04,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:04,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:04,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:04,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:04,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:04,802 INFO L87 Difference]: Start difference. First operand 6666 states and 10880 transitions. Second operand 3 states. [2019-09-08 05:46:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:05,144 INFO L93 Difference]: Finished difference Result 17499 states and 29264 transitions. [2019-09-08 05:46:05,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:05,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-09-08 05:46:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:05,199 INFO L225 Difference]: With dead ends: 17499 [2019-09-08 05:46:05,200 INFO L226 Difference]: Without dead ends: 10960 [2019-09-08 05:46:05,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10960 states. [2019-09-08 05:46:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10960 to 10956. [2019-09-08 05:46:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10956 states. [2019-09-08 05:46:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10956 states to 10956 states and 18401 transitions. [2019-09-08 05:46:06,450 INFO L78 Accepts]: Start accepts. Automaton has 10956 states and 18401 transitions. Word has length 193 [2019-09-08 05:46:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:06,451 INFO L475 AbstractCegarLoop]: Abstraction has 10956 states and 18401 transitions. [2019-09-08 05:46:06,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10956 states and 18401 transitions. [2019-09-08 05:46:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 05:46:06,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:06,508 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 05:46:06,508 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:06,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1832014825, now seen corresponding path program 1 times [2019-09-08 05:46:06,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:06,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:06,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:06,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:06,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:06,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:06,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:06,635 INFO L87 Difference]: Start difference. First operand 10956 states and 18401 transitions. Second operand 3 states. [2019-09-08 05:46:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:07,369 INFO L93 Difference]: Finished difference Result 29722 states and 50538 transitions. [2019-09-08 05:46:07,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:07,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-08 05:46:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:07,459 INFO L225 Difference]: With dead ends: 29722 [2019-09-08 05:46:07,459 INFO L226 Difference]: Without dead ends: 18900 [2019-09-08 05:46:07,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18900 states. [2019-09-08 05:46:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18900 to 18896. [2019-09-08 05:46:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18896 states. [2019-09-08 05:46:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18896 states to 18896 states and 32036 transitions. [2019-09-08 05:46:08,502 INFO L78 Accepts]: Start accepts. Automaton has 18896 states and 32036 transitions. Word has length 194 [2019-09-08 05:46:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:08,503 INFO L475 AbstractCegarLoop]: Abstraction has 18896 states and 32036 transitions. [2019-09-08 05:46:08,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 18896 states and 32036 transitions. [2019-09-08 05:46:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:46:08,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:08,649 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:08,649 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1915717494, now seen corresponding path program 1 times [2019-09-08 05:46:08,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:46:09,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:46:09,006 INFO L223 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) [2019-09-08 05:46:09,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:46:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:09,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 2645 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:46:09,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:46:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:46:09,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:46:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:46:09,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:46:09,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:46:09,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:46:09,492 INFO L87 Difference]: Start difference. First operand 18896 states and 32036 transitions. Second operand 6 states. [2019-09-08 05:46:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:09,931 INFO L93 Difference]: Finished difference Result 21286 states and 35353 transitions. [2019-09-08 05:46:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:46:09,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-09-08 05:46:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:10,023 INFO L225 Difference]: With dead ends: 21286 [2019-09-08 05:46:10,024 INFO L226 Difference]: Without dead ends: 19689 [2019-09-08 05:46:10,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:46:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19689 states. [2019-09-08 05:46:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19689 to 19611. [2019-09-08 05:46:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19611 states. [2019-09-08 05:46:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19611 states to 19611 states and 33136 transitions. [2019-09-08 05:46:11,275 INFO L78 Accepts]: Start accepts. Automaton has 19611 states and 33136 transitions. Word has length 201 [2019-09-08 05:46:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:11,276 INFO L475 AbstractCegarLoop]: Abstraction has 19611 states and 33136 transitions. [2019-09-08 05:46:11,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:46:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19611 states and 33136 transitions. [2019-09-08 05:46:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 05:46:11,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:11,342 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:11,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash -199085436, now seen corresponding path program 1 times [2019-09-08 05:46:11,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:11,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:11,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:11,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:11,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:11,468 INFO L87 Difference]: Start difference. First operand 19611 states and 33136 transitions. Second operand 3 states. [2019-09-08 05:46:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:13,078 INFO L93 Difference]: Finished difference Result 54907 states and 93689 transitions. [2019-09-08 05:46:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:13,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-08 05:46:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:13,248 INFO L225 Difference]: With dead ends: 54907 [2019-09-08 05:46:13,248 INFO L226 Difference]: Without dead ends: 35818 [2019-09-08 05:46:13,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35818 states. [2019-09-08 05:46:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35818 to 35814. [2019-09-08 05:46:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35814 states. [2019-09-08 05:46:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35814 states to 35814 states and 60745 transitions. [2019-09-08 05:46:14,971 INFO L78 Accepts]: Start accepts. Automaton has 35814 states and 60745 transitions. Word has length 195 [2019-09-08 05:46:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:14,972 INFO L475 AbstractCegarLoop]: Abstraction has 35814 states and 60745 transitions. [2019-09-08 05:46:14,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 35814 states and 60745 transitions. [2019-09-08 05:46:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 05:46:15,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:15,049 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:15,049 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash -345107031, now seen corresponding path program 1 times [2019-09-08 05:46:15,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:15,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:15,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:15,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:15,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:15,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:15,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:15,168 INFO L87 Difference]: Start difference. First operand 35814 states and 60745 transitions. Second operand 3 states. [2019-09-08 05:46:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:17,432 INFO L93 Difference]: Finished difference Result 100817 states and 171720 transitions. [2019-09-08 05:46:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:17,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 05:46:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:17,627 INFO L225 Difference]: With dead ends: 100817 [2019-09-08 05:46:17,627 INFO L226 Difference]: Without dead ends: 65638 [2019-09-08 05:46:17,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65638 states. [2019-09-08 05:46:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65638 to 65634. [2019-09-08 05:46:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65634 states. [2019-09-08 05:46:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65634 states to 65634 states and 110821 transitions. [2019-09-08 05:46:22,466 INFO L78 Accepts]: Start accepts. Automaton has 65634 states and 110821 transitions. Word has length 196 [2019-09-08 05:46:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:22,466 INFO L475 AbstractCegarLoop]: Abstraction has 65634 states and 110821 transitions. [2019-09-08 05:46:22,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 65634 states and 110821 transitions. [2019-09-08 05:46:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 05:46:22,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:22,578 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:22,578 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1708507642, now seen corresponding path program 1 times [2019-09-08 05:46:22,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:22,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:22,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:22,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:22,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:22,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:22,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:22,695 INFO L87 Difference]: Start difference. First operand 65634 states and 110821 transitions. Second operand 3 states. [2019-09-08 05:46:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:28,676 INFO L93 Difference]: Finished difference Result 186824 states and 314764 transitions. [2019-09-08 05:46:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:28,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 05:46:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:29,051 INFO L225 Difference]: With dead ends: 186824 [2019-09-08 05:46:29,051 INFO L226 Difference]: Without dead ends: 122059 [2019-09-08 05:46:29,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122059 states. [2019-09-08 05:46:34,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122059 to 122055. [2019-09-08 05:46:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122055 states. [2019-09-08 05:46:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122055 states to 122055 states and 203101 transitions. [2019-09-08 05:46:34,492 INFO L78 Accepts]: Start accepts. Automaton has 122055 states and 203101 transitions. Word has length 197 [2019-09-08 05:46:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:34,492 INFO L475 AbstractCegarLoop]: Abstraction has 122055 states and 203101 transitions. [2019-09-08 05:46:34,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 122055 states and 203101 transitions. [2019-09-08 05:46:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:46:34,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:34,671 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:34,671 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1293625257, now seen corresponding path program 1 times [2019-09-08 05:46:34,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:34,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:34,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:34,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:34,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:34,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:34,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:34,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:34,793 INFO L87 Difference]: Start difference. First operand 122055 states and 203101 transitions. Second operand 3 states. [2019-09-08 05:46:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:42,823 INFO L93 Difference]: Finished difference Result 228088 states and 378092 transitions. [2019-09-08 05:46:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:42,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 05:46:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:43,547 INFO L225 Difference]: With dead ends: 228088 [2019-09-08 05:46:43,548 INFO L226 Difference]: Without dead ends: 226491 [2019-09-08 05:46:43,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226491 states. [2019-09-08 05:46:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226491 to 226487. [2019-09-08 05:46:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226487 states. [2019-09-08 05:46:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226487 states to 226487 states and 371907 transitions. [2019-09-08 05:46:56,851 INFO L78 Accepts]: Start accepts. Automaton has 226487 states and 371907 transitions. Word has length 198 [2019-09-08 05:46:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:46:56,851 INFO L475 AbstractCegarLoop]: Abstraction has 226487 states and 371907 transitions. [2019-09-08 05:46:56,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:46:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 226487 states and 371907 transitions. [2019-09-08 05:46:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 05:46:57,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:46:57,069 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:46:57,069 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:46:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:46:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1607802886, now seen corresponding path program 1 times [2019-09-08 05:46:57,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:46:57,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:46:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:57,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:46:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:46:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:46:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:46:57,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:46:57,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:46:57,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:46:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:46:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:57,221 INFO L87 Difference]: Start difference. First operand 226487 states and 371907 transitions. Second operand 3 states. [2019-09-08 05:47:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:07,623 INFO L93 Difference]: Finished difference Result 228388 states and 374383 transitions. [2019-09-08 05:47:07,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:47:07,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-08 05:47:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:08,600 INFO L225 Difference]: With dead ends: 228388 [2019-09-08 05:47:08,600 INFO L226 Difference]: Without dead ends: 226843 [2019-09-08 05:47:08,691 INFO L628 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-09-08 05:47:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226843 states. [2019-09-08 05:47:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226843 to 226791. [2019-09-08 05:47:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226791 states. [2019-09-08 05:47:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226791 states to 226791 states and 372250 transitions. [2019-09-08 05:47:24,326 INFO L78 Accepts]: Start accepts. Automaton has 226791 states and 372250 transitions. Word has length 199 [2019-09-08 05:47:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:24,326 INFO L475 AbstractCegarLoop]: Abstraction has 226791 states and 372250 transitions. [2019-09-08 05:47:24,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:47:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 226791 states and 372250 transitions. [2019-09-08 05:47:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 05:47:25,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:25,226 INFO L399 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-09-08 05:47:25,226 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1208486188, now seen corresponding path program 1 times [2019-09-08 05:47:25,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:25,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:25,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:25,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:47:25,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:25,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:47:25,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:47:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:47:25,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:47:25,450 INFO L87 Difference]: Start difference. First operand 226791 states and 372250 transitions. Second operand 5 states. [2019-09-08 05:47:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:35,627 INFO L93 Difference]: Finished difference Result 227407 states and 373028 transitions. [2019-09-08 05:47:35,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:47:35,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 332 [2019-09-08 05:47:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:36,440 INFO L225 Difference]: With dead ends: 227407 [2019-09-08 05:47:36,440 INFO L226 Difference]: Without dead ends: 226186 [2019-09-08 05:47:36,524 INFO L628 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-09-08 05:47:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226186 states. [2019-09-08 05:47:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226186 to 226186. [2019-09-08 05:47:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226186 states. [2019-09-08 05:47:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226186 states to 226186 states and 371476 transitions. [2019-09-08 05:47:54,925 INFO L78 Accepts]: Start accepts. Automaton has 226186 states and 371476 transitions. Word has length 332 [2019-09-08 05:47:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:54,926 INFO L475 AbstractCegarLoop]: Abstraction has 226186 states and 371476 transitions. [2019-09-08 05:47:54,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:47:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 226186 states and 371476 transitions. [2019-09-08 05:47:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:47:55,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:55,855 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:47:55,855 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash -628676150, now seen corresponding path program 1 times [2019-09-08 05:47:55,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:55,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:55,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:55,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 05:47:56,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:56,110 INFO L223 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-09-08 05:47:56,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:56,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 05:47:56,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 05:47:57,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:47:57,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2019-09-08 05:47:57,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:47:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:47:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:47:57,298 INFO L87 Difference]: Start difference. First operand 226186 states and 371476 transitions. Second operand 25 states. [2019-09-08 05:48:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:18,171 INFO L93 Difference]: Finished difference Result 227145 states and 372702 transitions. [2019-09-08 05:48:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 05:48:18,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 333 [2019-09-08 05:48:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:18,892 INFO L225 Difference]: With dead ends: 227145 [2019-09-08 05:48:18,892 INFO L226 Difference]: Without dead ends: 226286 [2019-09-08 05:48:18,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=340, Invalid=3692, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 05:48:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226286 states. [2019-09-08 05:48:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226286 to 226251. [2019-09-08 05:48:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226251 states. [2019-09-08 05:48:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226251 states to 226251 states and 371568 transitions. [2019-09-08 05:48:36,391 INFO L78 Accepts]: Start accepts. Automaton has 226251 states and 371568 transitions. Word has length 333 [2019-09-08 05:48:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:36,391 INFO L475 AbstractCegarLoop]: Abstraction has 226251 states and 371568 transitions. [2019-09-08 05:48:36,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:48:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 226251 states and 371568 transitions. [2019-09-08 05:48:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-08 05:48:38,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:38,394 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 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-09-08 05:48:38,394 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:38,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1306976441, now seen corresponding path program 1 times [2019-09-08 05:48:38,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:38,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:38,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:38,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-08 05:48:38,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:48:38,688 INFO L223 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-09-08 05:48:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:39,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 3375 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:48:39,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:48:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-08 05:48:39,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:48:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-09-08 05:48:39,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:48:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:48:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:48:39,376 INFO L87 Difference]: Start difference. First operand 226251 states and 371568 transitions. Second operand 20 states. [2019-09-08 05:48:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:50,172 INFO L93 Difference]: Finished difference Result 234982 states and 384945 transitions. [2019-09-08 05:48:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:48:50,173 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 365 [2019-09-08 05:48:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:50,853 INFO L225 Difference]: With dead ends: 234982 [2019-09-08 05:48:50,853 INFO L226 Difference]: Without dead ends: 233453 [2019-09-08 05:48:50,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:48:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233453 states. [2019-09-08 05:49:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233453 to 233389. [2019-09-08 05:49:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233389 states. [2019-09-08 05:49:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233389 states to 233389 states and 382176 transitions. [2019-09-08 05:49:03,865 INFO L78 Accepts]: Start accepts. Automaton has 233389 states and 382176 transitions. Word has length 365 [2019-09-08 05:49:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:03,866 INFO L475 AbstractCegarLoop]: Abstraction has 233389 states and 382176 transitions. [2019-09-08 05:49:03,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:49:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 233389 states and 382176 transitions. [2019-09-08 05:49:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 05:49:04,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:04,816 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:49:04,816 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1216750746, now seen corresponding path program 2 times [2019-09-08 05:49:04,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:04,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 05:49:05,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:49:05,065 INFO L223 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-09-08 05:49:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:49:10,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:49:10,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:49:10,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 3269 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 05:49:10,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:49:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:49:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:49:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-08 05:49:10,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:49:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:49:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:49:10,805 INFO L87 Difference]: Start difference. First operand 233389 states and 382176 transitions. Second operand 16 states. [2019-09-08 05:49:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:56,752 INFO L93 Difference]: Finished difference Result 698595 states and 1181263 transitions. [2019-09-08 05:49:56,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 05:49:56,754 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 334 [2019-09-08 05:49:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:59,058 INFO L225 Difference]: With dead ends: 698595 [2019-09-08 05:49:59,059 INFO L226 Difference]: Without dead ends: 697782 [2019-09-08 05:49:59,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=554, Invalid=3352, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 05:49:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697782 states. [2019-09-08 05:50:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697782 to 470393. [2019-09-08 05:50:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470393 states. [2019-09-08 05:50:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470393 states to 470393 states and 794440 transitions. [2019-09-08 05:50:47,568 INFO L78 Accepts]: Start accepts. Automaton has 470393 states and 794440 transitions. Word has length 334 [2019-09-08 05:50:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:47,568 INFO L475 AbstractCegarLoop]: Abstraction has 470393 states and 794440 transitions. [2019-09-08 05:50:47,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:50:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 470393 states and 794440 transitions. [2019-09-08 05:50:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-08 05:50:50,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:50,687 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2019-09-08 05:50:50,687 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash -514594911, now seen corresponding path program 1 times [2019-09-08 05:50:50,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:50,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:50:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:50:51,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:50:51,136 INFO L223 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-09-08 05:50:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:51,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 3395 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:50:51,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:50:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:50:58,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:50:58,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 05:50:58,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:50:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:50:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:50:58,525 INFO L87 Difference]: Start difference. First operand 470393 states and 794440 transitions. Second operand 29 states. [2019-09-08 05:51:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:23,267 INFO L93 Difference]: Finished difference Result 655185 states and 1109084 transitions. [2019-09-08 05:51:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:51:23,267 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 370 [2019-09-08 05:51:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:24,643 INFO L225 Difference]: With dead ends: 655185 [2019-09-08 05:51:24,643 INFO L226 Difference]: Without dead ends: 423183 [2019-09-08 05:51:25,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=2995, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 05:51:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423183 states. [2019-09-08 05:52:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423183 to 423133. [2019-09-08 05:52:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423133 states. [2019-09-08 05:52:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423133 states to 423133 states and 710038 transitions. [2019-09-08 05:52:09,806 INFO L78 Accepts]: Start accepts. Automaton has 423133 states and 710038 transitions. Word has length 370 [2019-09-08 05:52:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:09,807 INFO L475 AbstractCegarLoop]: Abstraction has 423133 states and 710038 transitions. [2019-09-08 05:52:09,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:52:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 423133 states and 710038 transitions. [2019-09-08 05:52:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 05:52:13,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:13,797 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:52:13,797 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2082109083, now seen corresponding path program 1 times [2019-09-08 05:52:13,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:13,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:52:14,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:52:14,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:52:14,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:52:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:52:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:52:14,015 INFO L87 Difference]: Start difference. First operand 423133 states and 710038 transitions. Second operand 10 states. [2019-09-08 05:52:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:36,854 INFO L93 Difference]: Finished difference Result 424594 states and 711870 transitions. [2019-09-08 05:52:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:52:36,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 340 [2019-09-08 05:52:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:39,185 INFO L225 Difference]: With dead ends: 424594 [2019-09-08 05:52:39,185 INFO L226 Difference]: Without dead ends: 423133 [2019-09-08 05:52:39,310 INFO L628 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-09-08 05:52:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423133 states. [2019-09-08 05:53:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423133 to 423133. [2019-09-08 05:53:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423133 states. [2019-09-08 05:53:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423133 states to 423133 states and 710030 transitions. [2019-09-08 05:53:17,159 INFO L78 Accepts]: Start accepts. Automaton has 423133 states and 710030 transitions. Word has length 340 [2019-09-08 05:53:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:17,159 INFO L475 AbstractCegarLoop]: Abstraction has 423133 states and 710030 transitions. [2019-09-08 05:53:17,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:53:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 423133 states and 710030 transitions. [2019-09-08 05:53:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-08 05:53:18,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:18,987 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-08 05:53:18,987 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:18,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash 919008959, now seen corresponding path program 1 times [2019-09-08 05:53:18,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:18,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:18,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:18,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:53:19,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:53:19,181 INFO L223 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) [2019-09-08 05:53:19,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:53:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:20,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 3454 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 05:53:20,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:53:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 05:53:20,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:53:20,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [5] total 21 [2019-09-08 05:53:20,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:53:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:53:20,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:53:20,867 INFO L87 Difference]: Start difference. First operand 423133 states and 710030 transitions. Second operand 21 states. [2019-09-08 05:53:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:52,943 INFO L93 Difference]: Finished difference Result 428462 states and 716975 transitions. [2019-09-08 05:53:52,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:53:52,943 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 380 [2019-09-08 05:53:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:54,404 INFO L225 Difference]: With dead ends: 428462 [2019-09-08 05:53:54,404 INFO L226 Difference]: Without dead ends: 423310 [2019-09-08 05:53:54,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2019-09-08 05:53:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423310 states. [2019-09-08 05:54:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423310 to 423215. [2019-09-08 05:54:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423215 states. [2019-09-08 05:54:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423215 states to 423215 states and 710122 transitions. [2019-09-08 05:54:38,485 INFO L78 Accepts]: Start accepts. Automaton has 423215 states and 710122 transitions. Word has length 380 [2019-09-08 05:54:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:38,486 INFO L475 AbstractCegarLoop]: Abstraction has 423215 states and 710122 transitions. [2019-09-08 05:54:38,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:54:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 423215 states and 710122 transitions. [2019-09-08 05:54:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 05:54:40,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:40,286 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:54:40,286 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:40,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1524579197, now seen corresponding path program 1 times [2019-09-08 05:54:40,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:40,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:40,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:40,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:40,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:54:40,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:54:40,503 INFO L223 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) [2019-09-08 05:54:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:54:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:41,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 3379 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:54:41,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:54:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 05:54:41,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:54:41,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-09-08 05:54:41,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:54:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:54:41,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:54:41,807 INFO L87 Difference]: Start difference. First operand 423215 states and 710122 transitions. Second operand 12 states. [2019-09-08 05:55:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:55:17,215 INFO L93 Difference]: Finished difference Result 428227 states and 716280 transitions. [2019-09-08 05:55:17,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:55:17,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 364 [2019-09-08 05:55:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:55:17,217 INFO L225 Difference]: With dead ends: 428227 [2019-09-08 05:55:17,217 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 05:55:17,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2019-09-08 05:55:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 05:55:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 05:55:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 05:55:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 05:55:17,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 364 [2019-09-08 05:55:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:55:17,999 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 05:55:17,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:55:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 05:55:17,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 05:55:18,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.