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_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:48:42,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:48:42,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:48:42,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:48:42,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:48:42,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:48:42,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:48:42,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:48:42,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:48:42,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:48:42,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:48:42,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:48:42,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:48:42,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:48:42,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:48:42,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:48:42,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:48:42,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:48:42,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:48:42,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:48:42,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:48:42,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:48:42,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:48:42,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:48:42,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:48:42,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:48:42,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:48:42,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:48:42,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:48:42,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:48:42,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:48:42,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:48:42,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:48:42,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:48:42,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:48:42,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:48:42,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:48:42,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:48:42,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:48:42,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:48:42,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:48:42,733 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:48:42,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:48:42,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:48:42,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:48:42,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:48:42,762 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:48:42,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:48:42,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:48:42,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:48:42,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:48:42,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:48:42,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:48:42,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:48:42,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:48:42,766 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:48:42,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:48:42,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:48:42,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:48:42,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:48:42,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:48:42,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:48:42,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:48:42,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:48:42,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:48:42,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:48:42,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:48:42,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:48:42,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:48:42,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:48:42,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:48:42,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:48:42,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:48:42,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:48:42,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:48:42,832 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:48:42,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product35.cil.c [2019-09-08 05:48:42,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d701151/cb77e1fed72b416a80459c5aea8a930b/FLAG2b81c715c [2019-09-08 05:48:43,527 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:48:43,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product35.cil.c [2019-09-08 05:48:43,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d701151/cb77e1fed72b416a80459c5aea8a930b/FLAG2b81c715c [2019-09-08 05:48:43,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d701151/cb77e1fed72b416a80459c5aea8a930b [2019-09-08 05:48:43,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:48:43,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:48:43,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:48:43,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:48:43,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:48:43,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:48:43" (1/1) ... [2019-09-08 05:48:43,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4836f4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:43, skipping insertion in model container [2019-09-08 05:48:43,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:48:43" (1/1) ... [2019-09-08 05:48:43,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:48:43,826 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:48:44,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:48:44,740 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:48:44,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:48:45,048 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:48:45,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45 WrapperNode [2019-09-08 05:48:45,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:48:45,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:48:45,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:48:45,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:48:45,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (1/1) ... [2019-09-08 05:48:45,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:48:45,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:48:45,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:48:45,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:48:45,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (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:48:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:48:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:48:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:48:45,357 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:48:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:48:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:48:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:48:45,358 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:48:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:48:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:48:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:48:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:48:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:48:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:48:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:48:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:48:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:48:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:48:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:48:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:48:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:48:45,362 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:48:45,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:48:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:48:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:48:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:48:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:48:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:48:45,366 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:48:45,366 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:48:45,366 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:48:45,366 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:48:45,366 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:48:45,366 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:48:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:48:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:48:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:48:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:48:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:48:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:48:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:48:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:48:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:48:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:48:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:48:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:48:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:48:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:48:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:48:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:48:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:48:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:48:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:48:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:48:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:48:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:48:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:48:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:48:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:48:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:48:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:48:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:48:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:48:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:48:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:48:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:48:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:48:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:48:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:48:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:48:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:48:45,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:48:45,376 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:48:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:48:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:48:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:48:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:48:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:48:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:48:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:48:45,379 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:48:45,379 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:48:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:48:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:48:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:48:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:48:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:48:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:48:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:48:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:48:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:48:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:48:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:48:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:48:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:48:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:48:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:48:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:48:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:48:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:48:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:48:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:48:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:48:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:48:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:48:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:48:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:48:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:48:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:48:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:48:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:48:45,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:48:45,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:48:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:48:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:48:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:48:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:48:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:48:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:48:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:48:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:48:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:48:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:48:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:48:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:48:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:48:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:48:45,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:48:45,391 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:48:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:48:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:48:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:48:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:48:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:48:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:48:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:48:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:48:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:48:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:48:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:48:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:48:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:48:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:48:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:48:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:48:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:48:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:48:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:48:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:48:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:48:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:48:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:48:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:48:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:48:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:48:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:48:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:48:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:48:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:48:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:48:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:48:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:48:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:48:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:48:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:48:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:48:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:48:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:48:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:48:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:48:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:48:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:48:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:48:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:48:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:48:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:48:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:48:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:48:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:48:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:48:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:48:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:48:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:48:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:48:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:48:45,414 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:48:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:48:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:48:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:48:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:48:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:48:45,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:48:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:48:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:48:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:48:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:48:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:48:45,416 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:48:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:48:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:48:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:48:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:48:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:48:45,417 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:48:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:48:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:48:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:48:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:48:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:48:45,418 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:48:45,419 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:48:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:48:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:48:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:48:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:48:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:48:45,420 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:48:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:48:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:48:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:48:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:48:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:48:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:48:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:48:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:48:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:48:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:48:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:48:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:48:47,698 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:48:47,698 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:48:47,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:48:47 BoogieIcfgContainer [2019-09-08 05:48:47,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:48:47,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:48:47,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:48:47,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:48:47,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:48:43" (1/3) ... [2019-09-08 05:48:47,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c56aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:48:47, skipping insertion in model container [2019-09-08 05:48:47,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:48:45" (2/3) ... [2019-09-08 05:48:47,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c56aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:48:47, skipping insertion in model container [2019-09-08 05:48:47,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:48:47" (3/3) ... [2019-09-08 05:48:47,715 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product35.cil.c [2019-09-08 05:48:47,727 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:48:47,741 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:48:47,763 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:48:47,812 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:48:47,813 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:48:47,813 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:48:47,813 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:48:47,813 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:48:47,813 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:48:47,813 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:48:47,814 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:48:47,814 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:48:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states. [2019-09-08 05:48:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:48:47,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:47,891 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:48:47,895 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2049044822, now seen corresponding path program 1 times [2019-09-08 05:48:47,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:47,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:47,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:47,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:47,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:48,599 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:48:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:48:48,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:48:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:48:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:48:48,622 INFO L87 Difference]: Start difference. First operand 687 states. Second operand 2 states. [2019-09-08 05:48:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:48,705 INFO L93 Difference]: Finished difference Result 1049 states and 1409 transitions. [2019-09-08 05:48:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:48:48,708 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-08 05:48:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:48,737 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 05:48:48,737 INFO L226 Difference]: Without dead ends: 658 [2019-09-08 05:48:48,749 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:48:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-09-08 05:48:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-09-08 05:48:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-08 05:48:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 890 transitions. [2019-09-08 05:48:48,917 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 890 transitions. Word has length 167 [2019-09-08 05:48:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:48,920 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 890 transitions. [2019-09-08 05:48:48,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:48:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 890 transitions. [2019-09-08 05:48:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:48:48,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:48,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:48:48,936 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1717757499, now seen corresponding path program 1 times [2019-09-08 05:48:48,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:49,265 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:48:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:49,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:49,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:49,272 INFO L87 Difference]: Start difference. First operand 658 states and 890 transitions. Second operand 3 states. [2019-09-08 05:48:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:49,356 INFO L93 Difference]: Finished difference Result 1032 states and 1374 transitions. [2019-09-08 05:48:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:49,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:48:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:49,369 INFO L225 Difference]: With dead ends: 1032 [2019-09-08 05:48:49,369 INFO L226 Difference]: Without dead ends: 661 [2019-09-08 05:48:49,372 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:48:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-08 05:48:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 660. [2019-09-08 05:48:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 05:48:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 892 transitions. [2019-09-08 05:48:49,472 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 892 transitions. Word has length 168 [2019-09-08 05:48:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:49,473 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 892 transitions. [2019-09-08 05:48:49,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 892 transitions. [2019-09-08 05:48:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 05:48:49,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:49,477 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, 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:49,477 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2093739956, now seen corresponding path program 1 times [2019-09-08 05:48:49,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:49,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:49,664 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:48:49,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:49,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:49,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:49,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:49,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:49,669 INFO L87 Difference]: Start difference. First operand 660 states and 892 transitions. Second operand 3 states. [2019-09-08 05:48:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:49,713 INFO L93 Difference]: Finished difference Result 1300 states and 1788 transitions. [2019-09-08 05:48:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:49,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 05:48:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:49,722 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 05:48:49,723 INFO L226 Difference]: Without dead ends: 705 [2019-09-08 05:48:49,725 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:48:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-08 05:48:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 704. [2019-09-08 05:48:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-08 05:48:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 967 transitions. [2019-09-08 05:48:49,759 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 967 transitions. Word has length 180 [2019-09-08 05:48:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:49,760 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 967 transitions. [2019-09-08 05:48:49,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 967 transitions. [2019-09-08 05:48:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 05:48:49,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:49,767 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, 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:49,767 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1917860483, now seen corresponding path program 1 times [2019-09-08 05:48:49,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:49,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:49,972 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:48:49,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:49,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:49,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:49,975 INFO L87 Difference]: Start difference. First operand 704 states and 967 transitions. Second operand 3 states. [2019-09-08 05:48:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:50,034 INFO L93 Difference]: Finished difference Result 1429 states and 2008 transitions. [2019-09-08 05:48:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:50,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 05:48:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:50,042 INFO L225 Difference]: With dead ends: 1429 [2019-09-08 05:48:50,042 INFO L226 Difference]: Without dead ends: 790 [2019-09-08 05:48:50,046 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:48:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-08 05:48:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 789. [2019-09-08 05:48:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-08 05:48:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1111 transitions. [2019-09-08 05:48:50,089 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1111 transitions. Word has length 181 [2019-09-08 05:48:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:50,089 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1111 transitions. [2019-09-08 05:48:50,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1111 transitions. [2019-09-08 05:48:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 05:48:50,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:50,096 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, 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:50,097 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash 556295988, now seen corresponding path program 1 times [2019-09-08 05:48:50,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:50,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:50,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:50,398 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:48:50,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:50,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:50,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:50,400 INFO L87 Difference]: Start difference. First operand 789 states and 1111 transitions. Second operand 3 states. [2019-09-08 05:48:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:50,457 INFO L93 Difference]: Finished difference Result 1678 states and 2430 transitions. [2019-09-08 05:48:50,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:50,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 05:48:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:50,464 INFO L225 Difference]: With dead ends: 1678 [2019-09-08 05:48:50,464 INFO L226 Difference]: Without dead ends: 954 [2019-09-08 05:48:50,467 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:48:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-08 05:48:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 953. [2019-09-08 05:48:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-09-08 05:48:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1387 transitions. [2019-09-08 05:48:50,522 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1387 transitions. Word has length 182 [2019-09-08 05:48:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:50,522 INFO L475 AbstractCegarLoop]: Abstraction has 953 states and 1387 transitions. [2019-09-08 05:48:50,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1387 transitions. [2019-09-08 05:48:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 05:48:50,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:50,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:48:50,528 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash -398508003, now seen corresponding path program 1 times [2019-09-08 05:48:50,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:50,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:50,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:50,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:50,760 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:48:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:50,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:50,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:50,762 INFO L87 Difference]: Start difference. First operand 953 states and 1387 transitions. Second operand 3 states. [2019-09-08 05:48:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:50,811 INFO L93 Difference]: Finished difference Result 1452 states and 2059 transitions. [2019-09-08 05:48:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:50,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 05:48:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:50,820 INFO L225 Difference]: With dead ends: 1452 [2019-09-08 05:48:50,820 INFO L226 Difference]: Without dead ends: 1094 [2019-09-08 05:48:50,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:48:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-08 05:48:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1093. [2019-09-08 05:48:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-09-08 05:48:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1584 transitions. [2019-09-08 05:48:50,869 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1584 transitions. Word has length 184 [2019-09-08 05:48:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:50,871 INFO L475 AbstractCegarLoop]: Abstraction has 1093 states and 1584 transitions. [2019-09-08 05:48:50,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1584 transitions. [2019-09-08 05:48:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 05:48:50,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:50,882 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,882 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -167553219, now seen corresponding path program 1 times [2019-09-08 05:48:50,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:50,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:50,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:48:51,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:51,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:48:51,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:48:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:48:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:48:51,228 INFO L87 Difference]: Start difference. First operand 1093 states and 1584 transitions. Second operand 6 states. [2019-09-08 05:48:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:52,368 INFO L93 Difference]: Finished difference Result 2597 states and 3733 transitions. [2019-09-08 05:48:52,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:48:52,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2019-09-08 05:48:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:52,389 INFO L225 Difference]: With dead ends: 2597 [2019-09-08 05:48:52,390 INFO L226 Difference]: Without dead ends: 2137 [2019-09-08 05:48:52,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:48:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-09-08 05:48:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2126. [2019-09-08 05:48:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-09-08 05:48:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3110 transitions. [2019-09-08 05:48:52,527 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3110 transitions. Word has length 340 [2019-09-08 05:48:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:52,529 INFO L475 AbstractCegarLoop]: Abstraction has 2126 states and 3110 transitions. [2019-09-08 05:48:52,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:48:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3110 transitions. [2019-09-08 05:48:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 05:48:52,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:52,551 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,552 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:52,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1752113541, now seen corresponding path program 1 times [2019-09-08 05:48:52,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:52,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:52,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:52,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:48:52,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:48:52,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:48:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:48:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:48:52,924 INFO L87 Difference]: Start difference. First operand 2126 states and 3110 transitions. Second operand 11 states. [2019-09-08 05:48:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:53,494 INFO L93 Difference]: Finished difference Result 3043 states and 4319 transitions. [2019-09-08 05:48:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:48:53,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 341 [2019-09-08 05:48:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:53,512 INFO L225 Difference]: With dead ends: 3043 [2019-09-08 05:48:53,513 INFO L226 Difference]: Without dead ends: 2100 [2019-09-08 05:48:53,517 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:48:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-09-08 05:48:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2096. [2019-09-08 05:48:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2019-09-08 05:48:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3059 transitions. [2019-09-08 05:48:53,640 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3059 transitions. Word has length 341 [2019-09-08 05:48:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:53,640 INFO L475 AbstractCegarLoop]: Abstraction has 2096 states and 3059 transitions. [2019-09-08 05:48:53,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:48:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3059 transitions. [2019-09-08 05:48:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-08 05:48:53,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:53,659 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:53,659 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash -678612977, now seen corresponding path program 1 times [2019-09-08 05:48:53,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:53,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:53,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:53,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:53,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:48:53,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:53,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:53,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:53,974 INFO L87 Difference]: Start difference. First operand 2096 states and 3059 transitions. Second operand 3 states. [2019-09-08 05:48:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:54,105 INFO L93 Difference]: Finished difference Result 4761 states and 7127 transitions. [2019-09-08 05:48:54,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:54,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2019-09-08 05:48:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:54,128 INFO L225 Difference]: With dead ends: 4761 [2019-09-08 05:48:54,129 INFO L226 Difference]: Without dead ends: 2730 [2019-09-08 05:48:54,141 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:48:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-09-08 05:48:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2728. [2019-09-08 05:48:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2019-09-08 05:48:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 4123 transitions. [2019-09-08 05:48:54,356 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 4123 transitions. Word has length 383 [2019-09-08 05:48:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:54,357 INFO L475 AbstractCegarLoop]: Abstraction has 2728 states and 4123 transitions. [2019-09-08 05:48:54,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 4123 transitions. [2019-09-08 05:48:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-08 05:48:54,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:54,379 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:48:54,379 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1614984816, now seen corresponding path program 1 times [2019-09-08 05:48:54,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:54,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:54,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:54,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:48:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:54,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:54,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:54,627 INFO L87 Difference]: Start difference. First operand 2728 states and 4123 transitions. Second operand 3 states. [2019-09-08 05:48:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:54,775 INFO L93 Difference]: Finished difference Result 6609 states and 10239 transitions. [2019-09-08 05:48:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:54,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-09-08 05:48:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:54,800 INFO L225 Difference]: With dead ends: 6609 [2019-09-08 05:48:54,801 INFO L226 Difference]: Without dead ends: 3946 [2019-09-08 05:48:54,812 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:48:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-09-08 05:48:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3944. [2019-09-08 05:48:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-09-08 05:48:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 6155 transitions. [2019-09-08 05:48:55,019 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 6155 transitions. Word has length 384 [2019-09-08 05:48:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:55,019 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 6155 transitions. [2019-09-08 05:48:55,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 6155 transitions. [2019-09-08 05:48:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-08 05:48:55,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:55,043 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:55,044 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash -244601201, now seen corresponding path program 1 times [2019-09-08 05:48:55,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:55,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:55,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:48:55,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:55,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:55,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:55,340 INFO L87 Difference]: Start difference. First operand 3944 states and 6155 transitions. Second operand 3 states. [2019-09-08 05:48:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:55,638 INFO L93 Difference]: Finished difference Result 10161 states and 16175 transitions. [2019-09-08 05:48:55,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:55,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 385 [2019-09-08 05:48:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:55,690 INFO L225 Difference]: With dead ends: 10161 [2019-09-08 05:48:55,691 INFO L226 Difference]: Without dead ends: 6282 [2019-09-08 05:48:55,714 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:48:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2019-09-08 05:48:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6280. [2019-09-08 05:48:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2019-09-08 05:48:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 10027 transitions. [2019-09-08 05:48:56,102 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 10027 transitions. Word has length 385 [2019-09-08 05:48:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:56,104 INFO L475 AbstractCegarLoop]: Abstraction has 6280 states and 10027 transitions. [2019-09-08 05:48:56,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 10027 transitions. [2019-09-08 05:48:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-09-08 05:48:56,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:56,150 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,150 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2012869939, now seen corresponding path program 1 times [2019-09-08 05:48:56,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:48:56,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:56,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:48:56,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:48:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:48:56,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:48:56,479 INFO L87 Difference]: Start difference. First operand 6280 states and 10027 transitions. Second operand 3 states. [2019-09-08 05:48:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:56,870 INFO L93 Difference]: Finished difference Result 16977 states and 27471 transitions. [2019-09-08 05:48:56,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:48:56,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-09-08 05:48:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:56,954 INFO L225 Difference]: With dead ends: 16977 [2019-09-08 05:48:56,954 INFO L226 Difference]: Without dead ends: 10762 [2019-09-08 05:48:56,981 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:48:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10762 states. [2019-09-08 05:48:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10762 to 10760. [2019-09-08 05:48:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10760 states. [2019-09-08 05:48:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10760 states to 10760 states and 17387 transitions. [2019-09-08 05:48:58,086 INFO L78 Accepts]: Start accepts. Automaton has 10760 states and 17387 transitions. Word has length 384 [2019-09-08 05:48:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:58,086 INFO L475 AbstractCegarLoop]: Abstraction has 10760 states and 17387 transitions. [2019-09-08 05:48:58,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:48:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 10760 states and 17387 transitions. [2019-09-08 05:48:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 05:48:58,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:58,160 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:48:58,161 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1047746023, now seen corresponding path program 1 times [2019-09-08 05:48:58,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:48:58,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:48:58,685 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) [2019-09-08 05:48:58,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:48:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:59,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 3986 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:48:59,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:48:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:48:59,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:48:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:48:59,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:48:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:48:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:48:59,862 INFO L87 Difference]: Start difference. First operand 10760 states and 17387 transitions. Second operand 29 states. [2019-09-08 05:49:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:56,218 INFO L93 Difference]: Finished difference Result 38352 states and 61988 transitions. [2019-09-08 05:49:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 05:49:56,223 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 349 [2019-09-08 05:49:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:56,373 INFO L225 Difference]: With dead ends: 38352 [2019-09-08 05:49:56,373 INFO L226 Difference]: Without dead ends: 27361 [2019-09-08 05:49:56,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10462 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-09-08 05:49:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27361 states. [2019-09-08 05:49:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27361 to 26931. [2019-09-08 05:49:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26931 states. [2019-09-08 05:49:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26931 states to 26931 states and 43396 transitions. [2019-09-08 05:49:58,427 INFO L78 Accepts]: Start accepts. Automaton has 26931 states and 43396 transitions. Word has length 349 [2019-09-08 05:49:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:58,427 INFO L475 AbstractCegarLoop]: Abstraction has 26931 states and 43396 transitions. [2019-09-08 05:49:58,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:49:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 26931 states and 43396 transitions. [2019-09-08 05:49:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:49:58,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:58,700 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:49:58,701 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1742265452, now seen corresponding path program 1 times [2019-09-08 05:49:58,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:58,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:49:59,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:49:59,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:49:59,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:49:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:49:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:49:59,117 INFO L87 Difference]: Start difference. First operand 26931 states and 43396 transitions. Second operand 5 states. [2019-09-08 05:50:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:00,008 INFO L93 Difference]: Finished difference Result 33825 states and 52946 transitions. [2019-09-08 05:50:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:50:00,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 352 [2019-09-08 05:50:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:00,142 INFO L225 Difference]: With dead ends: 33825 [2019-09-08 05:50:00,143 INFO L226 Difference]: Without dead ends: 26341 [2019-09-08 05:50:01,153 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:50:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26341 states. [2019-09-08 05:50:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26341 to 26251. [2019-09-08 05:50:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26251 states. [2019-09-08 05:50:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26251 states to 26251 states and 42412 transitions. [2019-09-08 05:50:02,449 INFO L78 Accepts]: Start accepts. Automaton has 26251 states and 42412 transitions. Word has length 352 [2019-09-08 05:50:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:02,449 INFO L475 AbstractCegarLoop]: Abstraction has 26251 states and 42412 transitions. [2019-09-08 05:50:02,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:50:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26251 states and 42412 transitions. [2019-09-08 05:50:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:50:02,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:02,566 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:50:02,567 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1683570359, now seen corresponding path program 1 times [2019-09-08 05:50:02,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:02,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:02,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:02,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:02,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:50:03,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:50:03,090 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:50:03,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:03,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 3988 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:50:03,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:50:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:50:04,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:50:04,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:50:04,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:50:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:50:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:50:04,402 INFO L87 Difference]: Start difference. First operand 26251 states and 42412 transitions. Second operand 23 states. [2019-09-08 05:50:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:50:48,846 INFO L93 Difference]: Finished difference Result 60657 states and 97189 transitions. [2019-09-08 05:50:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:50:48,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 353 [2019-09-08 05:50:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:50:48,955 INFO L225 Difference]: With dead ends: 60657 [2019-09-08 05:50:48,955 INFO L226 Difference]: Without dead ends: 31612 [2019-09-08 05:50:49,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9618 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1916, Invalid=24816, Unknown=0, NotChecked=0, Total=26732 [2019-09-08 05:50:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31612 states. [2019-09-08 05:50:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31612 to 30160. [2019-09-08 05:50:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30160 states. [2019-09-08 05:50:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30160 states to 30160 states and 47968 transitions. [2019-09-08 05:50:50,649 INFO L78 Accepts]: Start accepts. Automaton has 30160 states and 47968 transitions. Word has length 353 [2019-09-08 05:50:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:50,649 INFO L475 AbstractCegarLoop]: Abstraction has 30160 states and 47968 transitions. [2019-09-08 05:50:50,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:50:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 30160 states and 47968 transitions. [2019-09-08 05:50:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:50:50,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:50:50,735 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:50:50,736 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:50:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:50:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1539467266, now seen corresponding path program 1 times [2019-09-08 05:50:50,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:50:50,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:50:50,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:50,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:50,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:50:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:50:51,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:50:51,190 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:50:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:50:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:50:51,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 3990 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:50:51,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:50:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:50:52,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:50:52,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:50:52,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:50:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:50:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:50:52,366 INFO L87 Difference]: Start difference. First operand 30160 states and 47968 transitions. Second operand 25 states. [2019-09-08 05:51:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:42,421 INFO L93 Difference]: Finished difference Result 70422 states and 111064 transitions. [2019-09-08 05:51:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:51:42,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 353 [2019-09-08 05:51:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:42,581 INFO L225 Difference]: With dead ends: 70422 [2019-09-08 05:51:42,582 INFO L226 Difference]: Without dead ends: 35906 [2019-09-08 05:51:42,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9619 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:51:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35906 states. [2019-09-08 05:51:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35906 to 33543. [2019-09-08 05:51:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33543 states. [2019-09-08 05:51:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33543 states to 33543 states and 52780 transitions. [2019-09-08 05:51:46,383 INFO L78 Accepts]: Start accepts. Automaton has 33543 states and 52780 transitions. Word has length 353 [2019-09-08 05:51:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:46,384 INFO L475 AbstractCegarLoop]: Abstraction has 33543 states and 52780 transitions. [2019-09-08 05:51:46,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:51:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33543 states and 52780 transitions. [2019-09-08 05:51:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 05:51:46,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:46,476 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:51:46,476 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1906154964, now seen corresponding path program 1 times [2019-09-08 05:51:46,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:46,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:46,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:46,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 05:51:46,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:51:46,862 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:51:46,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:47,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 3991 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:51:47,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:51:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:51:47,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:51:47,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:51:47,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:51:47,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:51:47,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:51:47,819 INFO L87 Difference]: Start difference. First operand 33543 states and 52780 transitions. Second operand 25 states. [2019-09-08 05:51:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:51:52,342 INFO L93 Difference]: Finished difference Result 68260 states and 108594 transitions. [2019-09-08 05:51:52,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:51:52,343 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 355 [2019-09-08 05:51:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:51:52,459 INFO L225 Difference]: With dead ends: 68260 [2019-09-08 05:51:52,460 INFO L226 Difference]: Without dead ends: 34370 [2019-09-08 05:51:52,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:51:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34370 states. [2019-09-08 05:51:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34370 to 34233. [2019-09-08 05:51:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34233 states. [2019-09-08 05:51:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34233 states to 34233 states and 53915 transitions. [2019-09-08 05:51:53,995 INFO L78 Accepts]: Start accepts. Automaton has 34233 states and 53915 transitions. Word has length 355 [2019-09-08 05:51:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:51:53,996 INFO L475 AbstractCegarLoop]: Abstraction has 34233 states and 53915 transitions. [2019-09-08 05:51:53,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:51:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34233 states and 53915 transitions. [2019-09-08 05:51:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 05:51:54,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:51:54,059 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:51:54,059 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:51:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:51:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1276780614, now seen corresponding path program 1 times [2019-09-08 05:51:54,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:51:54,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:51:54,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:54,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:51:54,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:51:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:51:54,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:51:54,320 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:51:54,334 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:51:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:51:54,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 3988 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:51:54,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:51:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:51:55,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:51:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 05:51:55,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:51:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:51:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:51:55,040 INFO L87 Difference]: Start difference. First operand 34233 states and 53915 transitions. Second operand 14 states. [2019-09-08 05:52:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:09,101 INFO L93 Difference]: Finished difference Result 104136 states and 179045 transitions. [2019-09-08 05:52:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:52:09,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 355 [2019-09-08 05:52:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:09,383 INFO L225 Difference]: With dead ends: 104136 [2019-09-08 05:52:09,383 INFO L226 Difference]: Without dead ends: 69983 [2019-09-08 05:52:09,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 05:52:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69983 states. [2019-09-08 05:52:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69983 to 67863. [2019-09-08 05:52:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67863 states. [2019-09-08 05:52:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67863 states to 67863 states and 115234 transitions. [2019-09-08 05:52:12,810 INFO L78 Accepts]: Start accepts. Automaton has 67863 states and 115234 transitions. Word has length 355 [2019-09-08 05:52:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:12,810 INFO L475 AbstractCegarLoop]: Abstraction has 67863 states and 115234 transitions. [2019-09-08 05:52:12,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:52:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 67863 states and 115234 transitions. [2019-09-08 05:52:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 05:52:12,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:12,892 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:52:12,893 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 149264511, now seen corresponding path program 1 times [2019-09-08 05:52:12,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:12,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 05:52:15,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:52:15,473 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:52:15,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:16,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 4115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:52:16,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:52:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:52:16,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:52:16,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 05:52:16,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:52:16,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:52:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:52:16,263 INFO L87 Difference]: Start difference. First operand 67863 states and 115234 transitions. Second operand 10 states. [2019-09-08 05:52:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:19,436 INFO L93 Difference]: Finished difference Result 135642 states and 240517 transitions. [2019-09-08 05:52:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:52:19,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 391 [2019-09-08 05:52:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:19,678 INFO L225 Difference]: With dead ends: 135642 [2019-09-08 05:52:19,678 INFO L226 Difference]: Without dead ends: 67859 [2019-09-08 05:52:19,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:52:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67859 states. [2019-09-08 05:52:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67859 to 67085. [2019-09-08 05:52:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67085 states. [2019-09-08 05:52:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67085 states to 67085 states and 112952 transitions. [2019-09-08 05:52:22,932 INFO L78 Accepts]: Start accepts. Automaton has 67085 states and 112952 transitions. Word has length 391 [2019-09-08 05:52:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:22,933 INFO L475 AbstractCegarLoop]: Abstraction has 67085 states and 112952 transitions. [2019-09-08 05:52:22,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:52:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 67085 states and 112952 transitions. [2019-09-08 05:52:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 05:52:23,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:23,018 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:52:23,018 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash -479914976, now seen corresponding path program 1 times [2019-09-08 05:52:23,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:52:23,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:52:23,509 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:52:23,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:24,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 3991 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:52:24,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:52:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 05:52:24,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:52:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 4] total 28 [2019-09-08 05:52:24,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 05:52:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 05:52:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:52:24,238 INFO L87 Difference]: Start difference. First operand 67085 states and 112952 transitions. Second operand 28 states. [2019-09-08 05:52:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:30,077 INFO L93 Difference]: Finished difference Result 127317 states and 256217 transitions. [2019-09-08 05:52:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 05:52:30,078 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 358 [2019-09-08 05:52:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:30,425 INFO L225 Difference]: With dead ends: 127317 [2019-09-08 05:52:30,426 INFO L226 Difference]: Without dead ends: 75233 [2019-09-08 05:52:30,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=1384, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:52:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75233 states. [2019-09-08 05:52:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75233 to 72451. [2019-09-08 05:52:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72451 states. [2019-09-08 05:52:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72451 states to 72451 states and 125520 transitions. [2019-09-08 05:52:38,336 INFO L78 Accepts]: Start accepts. Automaton has 72451 states and 125520 transitions. Word has length 358 [2019-09-08 05:52:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:38,337 INFO L475 AbstractCegarLoop]: Abstraction has 72451 states and 125520 transitions. [2019-09-08 05:52:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 05:52:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 72451 states and 125520 transitions. [2019-09-08 05:52:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 05:52:38,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:38,421 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,422 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:38,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2124955795, now seen corresponding path program 1 times [2019-09-08 05:52:38,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:38,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:38,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:52:38,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:52:38,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:52:38,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:52:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:52:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:52:38,652 INFO L87 Difference]: Start difference. First operand 72451 states and 125520 transitions. Second operand 7 states. [2019-09-08 05:52:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:41,492 INFO L93 Difference]: Finished difference Result 144778 states and 251670 transitions. [2019-09-08 05:52:41,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:52:41,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 398 [2019-09-08 05:52:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:41,774 INFO L225 Difference]: With dead ends: 144778 [2019-09-08 05:52:41,774 INFO L226 Difference]: Without dead ends: 72487 [2019-09-08 05:52:41,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:52:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72487 states. [2019-09-08 05:52:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72487 to 72487. [2019-09-08 05:52:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72487 states. [2019-09-08 05:52:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72487 states to 72487 states and 125564 transitions. [2019-09-08 05:52:48,258 INFO L78 Accepts]: Start accepts. Automaton has 72487 states and 125564 transitions. Word has length 398 [2019-09-08 05:52:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:48,259 INFO L475 AbstractCegarLoop]: Abstraction has 72487 states and 125564 transitions. [2019-09-08 05:52:48,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:52:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72487 states and 125564 transitions. [2019-09-08 05:52:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 05:52:48,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:48,393 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:52:48,393 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash -592392521, now seen corresponding path program 1 times [2019-09-08 05:52:48,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:48,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:52:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:52:48,650 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) [2019-09-08 05:52:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:52:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:49,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 4201 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:52:49,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:52:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 05:52:49,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:52:49,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-08 05:52:49,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:52:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:52:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:52:49,386 INFO L87 Difference]: Start difference. First operand 72487 states and 125564 transitions. Second operand 10 states. [2019-09-08 05:52:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:52,556 INFO L93 Difference]: Finished difference Result 144757 states and 251403 transitions. [2019-09-08 05:52:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:52:52,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 395 [2019-09-08 05:52:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:52,884 INFO L225 Difference]: With dead ends: 144757 [2019-09-08 05:52:52,884 INFO L226 Difference]: Without dead ends: 72421 [2019-09-08 05:52:53,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:52:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72421 states. [2019-09-08 05:52:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72421 to 72421. [2019-09-08 05:52:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72421 states. [2019-09-08 05:52:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72421 states to 72421 states and 124860 transitions. [2019-09-08 05:52:56,388 INFO L78 Accepts]: Start accepts. Automaton has 72421 states and 124860 transitions. Word has length 395 [2019-09-08 05:52:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:52:56,389 INFO L475 AbstractCegarLoop]: Abstraction has 72421 states and 124860 transitions. [2019-09-08 05:52:56,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:52:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 72421 states and 124860 transitions. [2019-09-08 05:52:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 05:52:56,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:52:56,520 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,520 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:52:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:52:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash -650248901, now seen corresponding path program 1 times [2019-09-08 05:52:56,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:52:56,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:52:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:52:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:52:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:52:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 05:52:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:52:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:52:56,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:52:56,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:52:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:52:56,738 INFO L87 Difference]: Start difference. First operand 72421 states and 124860 transitions. Second operand 6 states. [2019-09-08 05:52:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:52:59,307 INFO L93 Difference]: Finished difference Result 144680 states and 249514 transitions. [2019-09-08 05:52:59,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:52:59,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-08 05:52:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:52:59,584 INFO L225 Difference]: With dead ends: 144680 [2019-09-08 05:52:59,584 INFO L226 Difference]: Without dead ends: 72425 [2019-09-08 05:52:59,746 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:52:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72425 states. [2019-09-08 05:53:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72425 to 72421. [2019-09-08 05:53:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72421 states. [2019-09-08 05:53:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72421 states to 72421 states and 124604 transitions. [2019-09-08 05:53:06,189 INFO L78 Accepts]: Start accepts. Automaton has 72421 states and 124604 transitions. Word has length 403 [2019-09-08 05:53:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:06,189 INFO L475 AbstractCegarLoop]: Abstraction has 72421 states and 124604 transitions. [2019-09-08 05:53:06,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:53:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 72421 states and 124604 transitions. [2019-09-08 05:53:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-08 05:53:06,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:06,271 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:06,271 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -453166734, now seen corresponding path program 1 times [2019-09-08 05:53:06,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:06,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:06,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:06,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-08 05:53:06,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:06,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:53:06,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:53:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:53:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:53:06,532 INFO L87 Difference]: Start difference. First operand 72421 states and 124604 transitions. Second operand 10 states. [2019-09-08 05:53:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:09,400 INFO L93 Difference]: Finished difference Result 124801 states and 234736 transitions. [2019-09-08 05:53:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:53:09,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 403 [2019-09-08 05:53:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:09,664 INFO L225 Difference]: With dead ends: 124801 [2019-09-08 05:53:09,664 INFO L226 Difference]: Without dead ends: 73825 [2019-09-08 05:53:09,799 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:53:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73825 states. [2019-09-08 05:53:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73825 to 72697. [2019-09-08 05:53:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72697 states. [2019-09-08 05:53:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72697 states to 72697 states and 124989 transitions. [2019-09-08 05:53:13,471 INFO L78 Accepts]: Start accepts. Automaton has 72697 states and 124989 transitions. Word has length 403 [2019-09-08 05:53:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:13,472 INFO L475 AbstractCegarLoop]: Abstraction has 72697 states and 124989 transitions. [2019-09-08 05:53:13,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:53:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 72697 states and 124989 transitions. [2019-09-08 05:53:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-08 05:53:13,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:13,570 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:13,571 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash -506712708, now seen corresponding path program 1 times [2019-09-08 05:53:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:13,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 05:53:13,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:13,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:53:13,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:53:13,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:53:13,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:53:13,761 INFO L87 Difference]: Start difference. First operand 72697 states and 124989 transitions. Second operand 6 states. [2019-09-08 05:53:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:18,573 INFO L93 Difference]: Finished difference Result 145232 states and 249772 transitions. [2019-09-08 05:53:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:53:18,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 400 [2019-09-08 05:53:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:18,869 INFO L225 Difference]: With dead ends: 145232 [2019-09-08 05:53:18,869 INFO L226 Difference]: Without dead ends: 72701 [2019-09-08 05:53:19,396 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:53:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72701 states. [2019-09-08 05:53:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72701 to 72697. [2019-09-08 05:53:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72697 states. [2019-09-08 05:53:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72697 states to 72697 states and 124733 transitions. [2019-09-08 05:53:22,663 INFO L78 Accepts]: Start accepts. Automaton has 72697 states and 124733 transitions. Word has length 400 [2019-09-08 05:53:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:22,664 INFO L475 AbstractCegarLoop]: Abstraction has 72697 states and 124733 transitions. [2019-09-08 05:53:22,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:53:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 72697 states and 124733 transitions. [2019-09-08 05:53:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-08 05:53:22,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:22,752 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,752 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash -580670146, now seen corresponding path program 1 times [2019-09-08 05:53:22,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:22,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 05:53:22,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:53:22,976 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:53:22,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:23,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 4283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:53:23,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:53:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-08 05:53:23,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:53:23,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 05:53:23,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:53:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:53:23,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:53:23,739 INFO L87 Difference]: Start difference. First operand 72697 states and 124733 transitions. Second operand 10 states. [2019-09-08 05:53:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:33,897 INFO L93 Difference]: Finished difference Result 219230 states and 390099 transitions. [2019-09-08 05:53:33,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:53:33,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 420 [2019-09-08 05:53:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:34,492 INFO L225 Difference]: With dead ends: 219230 [2019-09-08 05:53:34,492 INFO L226 Difference]: Without dead ends: 162695 [2019-09-08 05:53:34,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:53:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162695 states. [2019-09-08 05:53:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162695 to 157827. [2019-09-08 05:53:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157827 states. [2019-09-08 05:53:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157827 states to 157827 states and 276556 transitions. [2019-09-08 05:53:43,042 INFO L78 Accepts]: Start accepts. Automaton has 157827 states and 276556 transitions. Word has length 420 [2019-09-08 05:53:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:43,042 INFO L475 AbstractCegarLoop]: Abstraction has 157827 states and 276556 transitions. [2019-09-08 05:53:43,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:53:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 157827 states and 276556 transitions. [2019-09-08 05:53:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-08 05:53:43,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:43,319 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,319 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -934882322, now seen corresponding path program 1 times [2019-09-08 05:53:43,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-08 05:53:44,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:44,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:53:44,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:53:44,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:53:44,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:53:44,576 INFO L87 Difference]: Start difference. First operand 157827 states and 276556 transitions. Second operand 8 states. [2019-09-08 05:54:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:03,786 INFO L93 Difference]: Finished difference Result 473771 states and 863240 transitions. [2019-09-08 05:54:03,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:54:03,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 428 [2019-09-08 05:54:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:11,782 INFO L225 Difference]: With dead ends: 473771 [2019-09-08 05:54:11,782 INFO L226 Difference]: Without dead ends: 316295 [2019-09-08 05:54:12,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:54:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316295 states. [2019-09-08 05:54:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316295 to 214810. [2019-09-08 05:54:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214810 states. [2019-09-08 05:54:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214810 states to 214810 states and 391313 transitions. [2019-09-08 05:54:26,380 INFO L78 Accepts]: Start accepts. Automaton has 214810 states and 391313 transitions. Word has length 428 [2019-09-08 05:54:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:26,381 INFO L475 AbstractCegarLoop]: Abstraction has 214810 states and 391313 transitions. [2019-09-08 05:54:26,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:54:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 214810 states and 391313 transitions. [2019-09-08 05:54:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 05:54:26,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:26,887 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:54:26,887 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash -662030720, now seen corresponding path program 1 times [2019-09-08 05:54:26,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:26,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:26,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:26,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:54:28,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:54:28,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:54:28,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:54:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:54:28,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:54:28,230 INFO L87 Difference]: Start difference. First operand 214810 states and 391313 transitions. Second operand 3 states. [2019-09-08 05:54:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:45,164 INFO L93 Difference]: Finished difference Result 496890 states and 916212 transitions. [2019-09-08 05:54:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:54:45,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-09-08 05:54:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:46,328 INFO L225 Difference]: With dead ends: 496890 [2019-09-08 05:54:46,328 INFO L226 Difference]: Without dead ends: 283621 [2019-09-08 05:54:46,812 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:54:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283621 states. [2019-09-08 05:55:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283621 to 283611. [2019-09-08 05:55:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283611 states. [2019-09-08 05:55:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283611 states to 283611 states and 525183 transitions. [2019-09-08 05:55:11,498 INFO L78 Accepts]: Start accepts. Automaton has 283611 states and 525183 transitions. Word has length 374 [2019-09-08 05:55:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:55:11,498 INFO L475 AbstractCegarLoop]: Abstraction has 283611 states and 525183 transitions. [2019-09-08 05:55:11,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:55:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 283611 states and 525183 transitions. [2019-09-08 05:55:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 05:55:12,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:55:12,383 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:55:12,384 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:55:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:55:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1388648329, now seen corresponding path program 1 times [2019-09-08 05:55:12,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:55:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:55:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:12,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:55:12,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:55:12,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:55:12,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:55:12,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:55:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:55:12,585 INFO L87 Difference]: Start difference. First operand 283611 states and 525183 transitions. Second operand 3 states. [2019-09-08 05:55:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:55:37,546 INFO L93 Difference]: Finished difference Result 697032 states and 1294110 transitions. [2019-09-08 05:55:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:55:37,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-08 05:55:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:55:48,452 INFO L225 Difference]: With dead ends: 697032 [2019-09-08 05:55:48,453 INFO L226 Difference]: Without dead ends: 415229 [2019-09-08 05:55:49,020 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:55:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415229 states. [2019-09-08 05:56:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415229 to 415219. [2019-09-08 05:56:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415219 states. [2019-09-08 05:56:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415219 states to 415219 states and 767647 transitions. [2019-09-08 05:56:26,734 INFO L78 Accepts]: Start accepts. Automaton has 415219 states and 767647 transitions. Word has length 373 [2019-09-08 05:56:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:26,734 INFO L475 AbstractCegarLoop]: Abstraction has 415219 states and 767647 transitions. [2019-09-08 05:56:26,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:56:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 415219 states and 767647 transitions. [2019-09-08 05:56:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 05:56:39,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:39,503 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, 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] [2019-09-08 05:56:39,503 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1050519592, now seen corresponding path program 1 times [2019-09-08 05:56:39,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:39,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:39,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:39,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:39,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:56:39,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:39,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:56:39,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:56:39,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:56:39,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:56:39,680 INFO L87 Difference]: Start difference. First operand 415219 states and 767647 transitions. Second operand 3 states. [2019-09-08 05:57:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:21,805 INFO L93 Difference]: Finished difference Result 1078054 states and 2013018 transitions. [2019-09-08 05:57:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:21,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-09-08 05:57:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:25,216 INFO L225 Difference]: With dead ends: 1078054 [2019-09-08 05:57:25,216 INFO L226 Difference]: Without dead ends: 665259 [2019-09-08 05:57:26,052 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:57:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665259 states. [2019-09-08 05:58:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665259 to 665249. [2019-09-08 05:58:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665249 states. [2019-09-08 05:58:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665249 states to 665249 states and 1240919 transitions. [2019-09-08 05:58:38,165 INFO L78 Accepts]: Start accepts. Automaton has 665249 states and 1240919 transitions. Word has length 374 [2019-09-08 05:58:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:38,165 INFO L475 AbstractCegarLoop]: Abstraction has 665249 states and 1240919 transitions. [2019-09-08 05:58:38,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 665249 states and 1240919 transitions.