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_spec6_product14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:20:44,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:20:44,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:20:44,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:20:44,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:20:44,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:20:44,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:20:44,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:20:44,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:20:44,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:20:44,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:20:44,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:20:44,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:20:44,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:20:44,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:20:44,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:20:44,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:20:44,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:20:44,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:20:44,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:20:44,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:20:44,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:20:44,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:20:44,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:20:44,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:20:44,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:20:44,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:20:44,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:20:44,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:20:44,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:20:44,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:20:44,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:20:44,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:20:44,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:20:44,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:20:44,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:20:44,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:20:44,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:20:44,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:20:44,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:20:44,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:20:44,884 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:20:44,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:20:44,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:20:44,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:20:44,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:20:44,908 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:20:44,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:20:44,908 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:20:44,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:20:44,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:20:44,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:20:44,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:20:44,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:20:44,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:20:44,911 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:20:44,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:20:44,911 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:20:44,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:20:44,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:20:44,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:20:44,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:20:44,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:20:44,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:20:44,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:20:44,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:20:44,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:20:44,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:20:44,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:20:44,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:20:44,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:20:44,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:20:44,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:20:44,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:20:44,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:20:44,983 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:20:44,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product14.cil.c [2019-09-08 05:20:45,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511ee5d8a/f85f31c2e14c4689b906ab604f62d48c/FLAGf912aee27 [2019-09-08 05:20:45,703 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:20:45,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product14.cil.c [2019-09-08 05:20:45,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511ee5d8a/f85f31c2e14c4689b906ab604f62d48c/FLAGf912aee27 [2019-09-08 05:20:45,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511ee5d8a/f85f31c2e14c4689b906ab604f62d48c [2019-09-08 05:20:45,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:20:45,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:20:45,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:20:45,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:20:45,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:20:45,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:20:45" (1/1) ... [2019-09-08 05:20:45,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d0c57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:45, skipping insertion in model container [2019-09-08 05:20:45,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:20:45" (1/1) ... [2019-09-08 05:20:45,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:20:46,016 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:20:46,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:20:46,810 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:20:46,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:20:47,102 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:20:47,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47 WrapperNode [2019-09-08 05:20:47,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:20:47,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:20:47,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:20:47,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:20:47,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (1/1) ... [2019-09-08 05:20:47,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:20:47,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:20:47,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:20:47,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:20:47,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (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:20:47,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:20:47,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:20:47,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:20:47,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:20:47,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:20:47,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:20:47,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:20:47,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:20:47,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:20:47,406 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:20:47,407 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:20:47,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:20:47,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:20:47,407 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:20:47,407 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:20:47,408 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:20:47,408 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:20:47,408 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:20:47,408 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:20:47,409 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:20:47,410 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:20:47,410 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:20:47,410 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:20:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:20:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:20:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:20:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:20:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:20:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:20:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:20:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:20:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:20:47,412 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:20:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:20:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:20:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:20:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:20:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:20:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:20:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:20:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:20:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:20:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:20:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:20:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 05:20:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:20:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:20:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:20:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:20:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:20:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:20:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:20:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:20:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:20:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:20:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:20:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:20:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:20:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:20:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:20:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:20:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:20:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:20:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:20:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:20:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:20:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:20:47,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:20:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:20:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:20:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:20:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:20:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:20:47,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:20:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:20:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:20:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:20:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:20:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:20:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:20:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:20:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:20:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:20:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:20:47,425 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:20:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:20:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:20:47,425 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:20:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:20:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:20:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:20:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:20:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:20:47,426 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:20:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:20:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:20:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:20:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:20:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:20:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:20:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:20:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:20:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:20:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:20:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:20:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:20:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:20:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:20:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:20:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:20:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:20:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:20:47,430 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:20:47,431 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:20:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:20:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:20:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:20:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-09-08 05:20:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-09-08 05:20:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:20:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:20:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:20:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:20:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:20:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:20:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:20:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:20:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:20:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:20:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:20:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:20:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:20:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:20:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:20:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:20:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:20:49,413 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:20:49,413 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:20:49,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:20:49 BoogieIcfgContainer [2019-09-08 05:20:49,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:20:49,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:20:49,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:20:49,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:20:49,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:20:45" (1/3) ... [2019-09-08 05:20:49,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b71297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:20:49, skipping insertion in model container [2019-09-08 05:20:49,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:20:47" (2/3) ... [2019-09-08 05:20:49,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b71297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:20:49, skipping insertion in model container [2019-09-08 05:20:49,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:20:49" (3/3) ... [2019-09-08 05:20:49,424 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product14.cil.c [2019-09-08 05:20:49,434 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:20:49,447 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:20:49,464 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:20:49,518 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:20:49,519 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:20:49,519 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:20:49,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:20:49,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:20:49,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:20:49,519 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:20:49,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:20:49,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:20:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states. [2019-09-08 05:20:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 05:20:49,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:49,609 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:49,614 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1152105549, now seen corresponding path program 1 times [2019-09-08 05:20:49,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:49,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:49,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:49,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:20:50,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:50,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:20:50,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:20:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:20:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:20:50,402 INFO L87 Difference]: Start difference. First operand 525 states. Second operand 2 states. [2019-09-08 05:20:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:50,520 INFO L93 Difference]: Finished difference Result 703 states and 971 transitions. [2019-09-08 05:20:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:20:50,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 185 [2019-09-08 05:20:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:50,560 INFO L225 Difference]: With dead ends: 703 [2019-09-08 05:20:50,560 INFO L226 Difference]: Without dead ends: 474 [2019-09-08 05:20:50,572 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:20:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-08 05:20:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-09-08 05:20:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-09-08 05:20:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 657 transitions. [2019-09-08 05:20:50,708 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 657 transitions. Word has length 185 [2019-09-08 05:20:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:50,710 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 657 transitions. [2019-09-08 05:20:50,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:20:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 657 transitions. [2019-09-08 05:20:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 05:20:50,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:50,718 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:50,718 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1212655790, now seen corresponding path program 1 times [2019-09-08 05:20:50,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:50,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:50,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:50,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:20:50,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:50,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:50,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:50,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:50,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:50,972 INFO L87 Difference]: Start difference. First operand 474 states and 657 transitions. Second operand 3 states. [2019-09-08 05:20:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:51,016 INFO L93 Difference]: Finished difference Result 686 states and 936 transitions. [2019-09-08 05:20:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:51,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 05:20:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:51,021 INFO L225 Difference]: With dead ends: 686 [2019-09-08 05:20:51,022 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 05:20:51,024 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:20:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 05:20:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 476. [2019-09-08 05:20:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-09-08 05:20:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 659 transitions. [2019-09-08 05:20:51,070 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 659 transitions. Word has length 186 [2019-09-08 05:20:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:51,071 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 659 transitions. [2019-09-08 05:20:51,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 659 transitions. [2019-09-08 05:20:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 05:20:51,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:51,077 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:51,077 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1634845758, now seen corresponding path program 1 times [2019-09-08 05:20:51,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:51,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:51,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:51,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:20:51,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:51,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:51,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:51,318 INFO L87 Difference]: Start difference. First operand 476 states and 659 transitions. Second operand 3 states. [2019-09-08 05:20:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:51,366 INFO L93 Difference]: Finished difference Result 928 states and 1316 transitions. [2019-09-08 05:20:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-08 05:20:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:51,377 INFO L225 Difference]: With dead ends: 928 [2019-09-08 05:20:51,377 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 05:20:51,379 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:20:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 05:20:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-09-08 05:20:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 05:20:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 728 transitions. [2019-09-08 05:20:51,423 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 728 transitions. Word has length 192 [2019-09-08 05:20:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:51,423 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 728 transitions. [2019-09-08 05:20:51,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 728 transitions. [2019-09-08 05:20:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 05:20:51,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:51,433 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:51,433 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1046878051, now seen corresponding path program 1 times [2019-09-08 05:20:51,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:20:51,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:51,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:20:51,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:20:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:20:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:20:51,855 INFO L87 Difference]: Start difference. First operand 516 states and 728 transitions. Second operand 11 states. [2019-09-08 05:20:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:56,229 INFO L93 Difference]: Finished difference Result 2227 states and 3265 transitions. [2019-09-08 05:20:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:20:56,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 193 [2019-09-08 05:20:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:56,249 INFO L225 Difference]: With dead ends: 2227 [2019-09-08 05:20:56,249 INFO L226 Difference]: Without dead ends: 2031 [2019-09-08 05:20:56,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:20:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-09-08 05:20:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2010. [2019-09-08 05:20:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-09-08 05:20:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2895 transitions. [2019-09-08 05:20:56,404 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2895 transitions. Word has length 193 [2019-09-08 05:20:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:56,406 INFO L475 AbstractCegarLoop]: Abstraction has 2010 states and 2895 transitions. [2019-09-08 05:20:56,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:20:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2895 transitions. [2019-09-08 05:20:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 05:20:56,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:56,411 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:56,411 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1130161941, now seen corresponding path program 1 times [2019-09-08 05:20:56,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:56,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:56,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:20:56,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:56,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:20:56,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:20:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:20:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:20:56,763 INFO L87 Difference]: Start difference. First operand 2010 states and 2895 transitions. Second operand 18 states. [2019-09-08 05:20:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:57,355 INFO L93 Difference]: Finished difference Result 3735 states and 5497 transitions. [2019-09-08 05:20:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:20:57,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 194 [2019-09-08 05:20:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:57,375 INFO L225 Difference]: With dead ends: 3735 [2019-09-08 05:20:57,375 INFO L226 Difference]: Without dead ends: 2027 [2019-09-08 05:20:57,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:20:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-08 05:20:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2025. [2019-09-08 05:20:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-09-08 05:20:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2896 transitions. [2019-09-08 05:20:57,494 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2896 transitions. Word has length 194 [2019-09-08 05:20:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:57,496 INFO L475 AbstractCegarLoop]: Abstraction has 2025 states and 2896 transitions. [2019-09-08 05:20:57,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:20:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2896 transitions. [2019-09-08 05:20:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:20:57,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:57,500 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:57,501 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:57,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:57,501 INFO L82 PathProgramCache]: Analyzing trace with hash -463407390, now seen corresponding path program 1 times [2019-09-08 05:20:57,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:57,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:57,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:20:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:20:57,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:20:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:20:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:20:57,695 INFO L87 Difference]: Start difference. First operand 2025 states and 2896 transitions. Second operand 6 states. [2019-09-08 05:20:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:58,289 INFO L93 Difference]: Finished difference Result 5814 states and 8483 transitions. [2019-09-08 05:20:58,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:20:58,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-08 05:20:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:58,331 INFO L225 Difference]: With dead ends: 5814 [2019-09-08 05:20:58,331 INFO L226 Difference]: Without dead ends: 4137 [2019-09-08 05:20:58,347 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:20:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2019-09-08 05:20:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4066. [2019-09-08 05:20:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2019-09-08 05:20:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 5906 transitions. [2019-09-08 05:20:58,698 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 5906 transitions. Word has length 203 [2019-09-08 05:20:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:58,701 INFO L475 AbstractCegarLoop]: Abstraction has 4066 states and 5906 transitions. [2019-09-08 05:20:58,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:20:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 5906 transitions. [2019-09-08 05:20:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:20:58,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:58,709 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:58,710 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1740905386, now seen corresponding path program 1 times [2019-09-08 05:20:58,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:58,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:58,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:58,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:58,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:20:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:58,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:20:58,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:20:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:20:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:20:58,924 INFO L87 Difference]: Start difference. First operand 4066 states and 5906 transitions. Second operand 11 states. [2019-09-08 05:20:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:59,452 INFO L93 Difference]: Finished difference Result 7559 states and 10999 transitions. [2019-09-08 05:20:59,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:20:59,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2019-09-08 05:20:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:59,483 INFO L225 Difference]: With dead ends: 7559 [2019-09-08 05:20:59,483 INFO L226 Difference]: Without dead ends: 4120 [2019-09-08 05:20:59,499 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:20:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-09-08 05:20:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4102. [2019-09-08 05:20:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-09-08 05:20:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5942 transitions. [2019-09-08 05:20:59,742 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5942 transitions. Word has length 204 [2019-09-08 05:20:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:59,745 INFO L475 AbstractCegarLoop]: Abstraction has 4102 states and 5942 transitions. [2019-09-08 05:20:59,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:20:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5942 transitions. [2019-09-08 05:20:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:20:59,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:59,754 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:59,755 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1967285791, now seen corresponding path program 1 times [2019-09-08 05:20:59,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:59,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:59,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:59,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:20:59,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:20:59,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:20:59,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:20:59,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:20:59,971 INFO L87 Difference]: Start difference. First operand 4102 states and 5942 transitions. Second operand 5 states. [2019-09-08 05:21:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:01,240 INFO L93 Difference]: Finished difference Result 14991 states and 21806 transitions. [2019-09-08 05:21:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:21:01,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 05:21:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:01,347 INFO L225 Difference]: With dead ends: 14991 [2019-09-08 05:21:01,347 INFO L226 Difference]: Without dead ends: 11518 [2019-09-08 05:21:01,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:21:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2019-09-08 05:21:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 11406. [2019-09-08 05:21:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11406 states. [2019-09-08 05:21:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11406 states to 11406 states and 16528 transitions. [2019-09-08 05:21:02,574 INFO L78 Accepts]: Start accepts. Automaton has 11406 states and 16528 transitions. Word has length 204 [2019-09-08 05:21:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:02,575 INFO L475 AbstractCegarLoop]: Abstraction has 11406 states and 16528 transitions. [2019-09-08 05:21:02,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:21:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11406 states and 16528 transitions. [2019-09-08 05:21:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:21:02,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:02,589 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:02,589 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1138512224, now seen corresponding path program 1 times [2019-09-08 05:21:02,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:02,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:02,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:21:02,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:02,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:02,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:02,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:02,753 INFO L87 Difference]: Start difference. First operand 11406 states and 16528 transitions. Second operand 3 states. [2019-09-08 05:21:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:03,107 INFO L93 Difference]: Finished difference Result 23075 states and 33592 transitions. [2019-09-08 05:21:03,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:03,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 05:21:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:03,188 INFO L225 Difference]: With dead ends: 23075 [2019-09-08 05:21:03,188 INFO L226 Difference]: Without dead ends: 11734 [2019-09-08 05:21:03,241 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:21:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2019-09-08 05:21:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11730. [2019-09-08 05:21:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11730 states. [2019-09-08 05:21:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11730 states to 11730 states and 17125 transitions. [2019-09-08 05:21:04,014 INFO L78 Accepts]: Start accepts. Automaton has 11730 states and 17125 transitions. Word has length 233 [2019-09-08 05:21:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:04,015 INFO L475 AbstractCegarLoop]: Abstraction has 11730 states and 17125 transitions. [2019-09-08 05:21:04,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 11730 states and 17125 transitions. [2019-09-08 05:21:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:21:04,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:04,030 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:04,030 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1943049739, now seen corresponding path program 1 times [2019-09-08 05:21:04,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:04,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:21:04,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:04,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:04,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:04,182 INFO L87 Difference]: Start difference. First operand 11730 states and 17125 transitions. Second operand 3 states. [2019-09-08 05:21:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:04,497 INFO L93 Difference]: Finished difference Result 24007 states and 35319 transitions. [2019-09-08 05:21:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:04,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-08 05:21:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:04,559 INFO L225 Difference]: With dead ends: 24007 [2019-09-08 05:21:04,559 INFO L226 Difference]: Without dead ends: 12342 [2019-09-08 05:21:04,609 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:21:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2019-09-08 05:21:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 12338. [2019-09-08 05:21:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12338 states. [2019-09-08 05:21:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12338 states to 12338 states and 18247 transitions. [2019-09-08 05:21:05,329 INFO L78 Accepts]: Start accepts. Automaton has 12338 states and 18247 transitions. Word has length 240 [2019-09-08 05:21:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:05,330 INFO L475 AbstractCegarLoop]: Abstraction has 12338 states and 18247 transitions. [2019-09-08 05:21:05,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 12338 states and 18247 transitions. [2019-09-08 05:21:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 05:21:05,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:05,349 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:05,349 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1178690466, now seen corresponding path program 1 times [2019-09-08 05:21:05,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:05,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:05,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:21:05,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:05,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:21:05,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:21:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:21:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:21:05,540 INFO L87 Difference]: Start difference. First operand 12338 states and 18247 transitions. Second operand 8 states. [2019-09-08 05:21:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:10,454 INFO L93 Difference]: Finished difference Result 37380 states and 56731 transitions. [2019-09-08 05:21:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:21:10,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2019-09-08 05:21:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:10,604 INFO L225 Difference]: With dead ends: 37380 [2019-09-08 05:21:10,604 INFO L226 Difference]: Without dead ends: 25107 [2019-09-08 05:21:10,646 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:21:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25107 states. [2019-09-08 05:21:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25107 to 14654. [2019-09-08 05:21:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14654 states. [2019-09-08 05:21:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14654 states to 14654 states and 22883 transitions. [2019-09-08 05:21:11,748 INFO L78 Accepts]: Start accepts. Automaton has 14654 states and 22883 transitions. Word has length 235 [2019-09-08 05:21:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:11,750 INFO L475 AbstractCegarLoop]: Abstraction has 14654 states and 22883 transitions. [2019-09-08 05:21:11,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:21:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14654 states and 22883 transitions. [2019-09-08 05:21:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 05:21:11,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:11,793 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:11,793 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:11,794 INFO L82 PathProgramCache]: Analyzing trace with hash -119692922, now seen corresponding path program 1 times [2019-09-08 05:21:11,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:11,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:11,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:11,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:11,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:21:12,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:12,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:21:12,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:21:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:21:12,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:21:12,010 INFO L87 Difference]: Start difference. First operand 14654 states and 22883 transitions. Second operand 8 states. [2019-09-08 05:21:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:16,458 INFO L93 Difference]: Finished difference Result 44864 states and 72887 transitions. [2019-09-08 05:21:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:21:16,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-09-08 05:21:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:16,610 INFO L225 Difference]: With dead ends: 44864 [2019-09-08 05:21:16,610 INFO L226 Difference]: Without dead ends: 30275 [2019-09-08 05:21:16,671 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:21:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2019-09-08 05:21:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 19406. [2019-09-08 05:21:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19406 states. [2019-09-08 05:21:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 32995 transitions. [2019-09-08 05:21:18,782 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 32995 transitions. Word has length 236 [2019-09-08 05:21:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:18,782 INFO L475 AbstractCegarLoop]: Abstraction has 19406 states and 32995 transitions. [2019-09-08 05:21:18,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:21:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 32995 transitions. [2019-09-08 05:21:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 05:21:18,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:18,872 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:18,873 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1691671394, now seen corresponding path program 1 times [2019-09-08 05:21:18,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:21:19,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:19,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:21:19,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:21:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:21:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:21:19,065 INFO L87 Difference]: Start difference. First operand 19406 states and 32995 transitions. Second operand 8 states. [2019-09-08 05:21:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:23,764 INFO L93 Difference]: Finished difference Result 60104 states and 107675 transitions. [2019-09-08 05:21:23,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:21:23,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 237 [2019-09-08 05:21:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:23,987 INFO L225 Difference]: With dead ends: 60104 [2019-09-08 05:21:23,987 INFO L226 Difference]: Without dead ends: 40763 [2019-09-08 05:21:24,070 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:21:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40763 states. [2019-09-08 05:21:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40763 to 29038. [2019-09-08 05:21:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29038 states. [2019-09-08 05:21:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29038 states to 29038 states and 54759 transitions. [2019-09-08 05:21:25,920 INFO L78 Accepts]: Start accepts. Automaton has 29038 states and 54759 transitions. Word has length 237 [2019-09-08 05:21:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:25,920 INFO L475 AbstractCegarLoop]: Abstraction has 29038 states and 54759 transitions. [2019-09-08 05:21:25,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:21:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 29038 states and 54759 transitions. [2019-09-08 05:21:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 05:21:26,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:26,053 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:26,053 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash 59338952, now seen corresponding path program 1 times [2019-09-08 05:21:26,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:26,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:21:26,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:26,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:26,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:26,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:26,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:26,199 INFO L87 Difference]: Start difference. First operand 29038 states and 54759 transitions. Second operand 3 states. [2019-09-08 05:21:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:28,327 INFO L93 Difference]: Finished difference Result 67359 states and 132617 transitions. [2019-09-08 05:21:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:28,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-08 05:21:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:28,568 INFO L225 Difference]: With dead ends: 67359 [2019-09-08 05:21:28,568 INFO L226 Difference]: Without dead ends: 38386 [2019-09-08 05:21:28,731 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:21:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38386 states. [2019-09-08 05:21:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38386 to 38382. [2019-09-08 05:21:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38382 states. [2019-09-08 05:21:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38382 states to 38382 states and 77671 transitions. [2019-09-08 05:21:30,707 INFO L78 Accepts]: Start accepts. Automaton has 38382 states and 77671 transitions. Word has length 248 [2019-09-08 05:21:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:30,708 INFO L475 AbstractCegarLoop]: Abstraction has 38382 states and 77671 transitions. [2019-09-08 05:21:30,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38382 states and 77671 transitions. [2019-09-08 05:21:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 05:21:30,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:30,851 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:30,851 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -466777274, now seen corresponding path program 1 times [2019-09-08 05:21:30,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:30,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:30,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:30,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:30,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:21:31,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:31,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:21:31,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:21:31,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:21:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:21:31,100 INFO L87 Difference]: Start difference. First operand 38382 states and 77671 transitions. Second operand 11 states. [2019-09-08 05:21:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:33,347 INFO L93 Difference]: Finished difference Result 56157 states and 105260 transitions. [2019-09-08 05:21:33,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:21:33,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2019-09-08 05:21:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:33,625 INFO L225 Difference]: With dead ends: 56157 [2019-09-08 05:21:33,626 INFO L226 Difference]: Without dead ends: 48910 [2019-09-08 05:21:33,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:21:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48910 states. [2019-09-08 05:21:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48910 to 48282. [2019-09-08 05:21:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48282 states. [2019-09-08 05:21:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48282 states to 48282 states and 93437 transitions. [2019-09-08 05:21:37,724 INFO L78 Accepts]: Start accepts. Automaton has 48282 states and 93437 transitions. Word has length 247 [2019-09-08 05:21:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:37,725 INFO L475 AbstractCegarLoop]: Abstraction has 48282 states and 93437 transitions. [2019-09-08 05:21:37,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:21:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 48282 states and 93437 transitions. [2019-09-08 05:21:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 05:21:37,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:37,839 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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:21:37,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2074583391, now seen corresponding path program 1 times [2019-09-08 05:21:37,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:37,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:37,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:37,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 05:21:38,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:38,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:21:38,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:21:38,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:21:38,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:21:38,046 INFO L87 Difference]: Start difference. First operand 48282 states and 93437 transitions. Second operand 6 states. [2019-09-08 05:21:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:40,289 INFO L93 Difference]: Finished difference Result 96577 states and 187173 transitions. [2019-09-08 05:21:40,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:21:40,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-08 05:21:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:40,527 INFO L225 Difference]: With dead ends: 96577 [2019-09-08 05:21:40,527 INFO L226 Difference]: Without dead ends: 48360 [2019-09-08 05:21:40,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:21:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48360 states. [2019-09-08 05:21:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48360 to 48358. [2019-09-08 05:21:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48358 states. [2019-09-08 05:21:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48358 states to 48358 states and 93519 transitions. [2019-09-08 05:21:45,631 INFO L78 Accepts]: Start accepts. Automaton has 48358 states and 93519 transitions. Word has length 259 [2019-09-08 05:21:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:45,632 INFO L475 AbstractCegarLoop]: Abstraction has 48358 states and 93519 transitions. [2019-09-08 05:21:45,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:21:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48358 states and 93519 transitions. [2019-09-08 05:21:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:21:45,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:45,786 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:45,787 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1649954800, now seen corresponding path program 1 times [2019-09-08 05:21:45,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:45,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:45,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:45,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:21:45,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:45,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:21:45,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:21:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:21:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:21:45,947 INFO L87 Difference]: Start difference. First operand 48358 states and 93519 transitions. Second operand 6 states. [2019-09-08 05:21:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:47,699 INFO L93 Difference]: Finished difference Result 96759 states and 188975 transitions. [2019-09-08 05:21:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:21:47,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-09-08 05:21:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:47,962 INFO L225 Difference]: With dead ends: 96759 [2019-09-08 05:21:47,962 INFO L226 Difference]: Without dead ends: 48478 [2019-09-08 05:21:48,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:21:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-09-08 05:21:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 48478. [2019-09-08 05:21:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48478 states. [2019-09-08 05:21:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48478 states to 48478 states and 93081 transitions. [2019-09-08 05:21:50,467 INFO L78 Accepts]: Start accepts. Automaton has 48478 states and 93081 transitions. Word has length 242 [2019-09-08 05:21:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:50,468 INFO L475 AbstractCegarLoop]: Abstraction has 48478 states and 93081 transitions. [2019-09-08 05:21:50,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:21:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48478 states and 93081 transitions. [2019-09-08 05:21:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 05:21:50,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:50,611 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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:21:50,611 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1697517415, now seen corresponding path program 1 times [2019-09-08 05:21:50,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:50,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:50,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:21:50,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:50,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:21:50,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:21:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:21:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:21:50,990 INFO L87 Difference]: Start difference. First operand 48478 states and 93081 transitions. Second operand 22 states. [2019-09-08 05:22:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:10,533 INFO L93 Difference]: Finished difference Result 137306 states and 263297 transitions. [2019-09-08 05:22:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 05:22:10,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 261 [2019-09-08 05:22:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:11,668 INFO L225 Difference]: With dead ends: 137306 [2019-09-08 05:22:11,668 INFO L226 Difference]: Without dead ends: 121751 [2019-09-08 05:22:11,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=451, Invalid=3709, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 05:22:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121751 states. [2019-09-08 05:22:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121751 to 118326. [2019-09-08 05:22:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118326 states. [2019-09-08 05:22:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118326 states to 118326 states and 228398 transitions. [2019-09-08 05:22:20,761 INFO L78 Accepts]: Start accepts. Automaton has 118326 states and 228398 transitions. Word has length 261 [2019-09-08 05:22:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:20,762 INFO L475 AbstractCegarLoop]: Abstraction has 118326 states and 228398 transitions. [2019-09-08 05:22:20,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:22:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 118326 states and 228398 transitions. [2019-09-08 05:22:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:22:21,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:21,041 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,042 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:21,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2052450340, now seen corresponding path program 1 times [2019-09-08 05:22:21,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:21,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:21,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:22:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:21,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:22:21,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:22:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:22:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:22:21,211 INFO L87 Difference]: Start difference. First operand 118326 states and 228398 transitions. Second operand 6 states. [2019-09-08 05:22:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:27,047 INFO L93 Difference]: Finished difference Result 236321 states and 470196 transitions. [2019-09-08 05:22:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:22:27,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2019-09-08 05:22:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:27,573 INFO L225 Difference]: With dead ends: 236321 [2019-09-08 05:22:27,574 INFO L226 Difference]: Without dead ends: 118072 [2019-09-08 05:22:33,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:22:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118072 states. [2019-09-08 05:22:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118072 to 118070. [2019-09-08 05:22:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118070 states. [2019-09-08 05:22:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118070 states to 118070 states and 208875 transitions. [2019-09-08 05:22:39,149 INFO L78 Accepts]: Start accepts. Automaton has 118070 states and 208875 transitions. Word has length 245 [2019-09-08 05:22:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:39,149 INFO L475 AbstractCegarLoop]: Abstraction has 118070 states and 208875 transitions. [2019-09-08 05:22:39,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:22:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 118070 states and 208875 transitions. [2019-09-08 05:22:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 05:22:39,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:39,343 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:39,343 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1003990377, now seen corresponding path program 1 times [2019-09-08 05:22:39,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:22:40,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:40,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:22:40,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:22:40,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:22:40,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:22:40,140 INFO L87 Difference]: Start difference. First operand 118070 states and 208875 transitions. Second operand 5 states. [2019-09-08 05:22:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:46,409 INFO L93 Difference]: Finished difference Result 177359 states and 302539 transitions. [2019-09-08 05:22:46,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:22:46,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2019-09-08 05:22:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:46,797 INFO L225 Difference]: With dead ends: 177359 [2019-09-08 05:22:46,798 INFO L226 Difference]: Without dead ends: 102218 [2019-09-08 05:22:46,966 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:22:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102218 states. [2019-09-08 05:22:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102218 to 102022. [2019-09-08 05:22:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102022 states. [2019-09-08 05:22:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102022 states to 102022 states and 182715 transitions. [2019-09-08 05:22:52,484 INFO L78 Accepts]: Start accepts. Automaton has 102022 states and 182715 transitions. Word has length 252 [2019-09-08 05:22:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:52,485 INFO L475 AbstractCegarLoop]: Abstraction has 102022 states and 182715 transitions. [2019-09-08 05:22:52,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:22:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 102022 states and 182715 transitions. [2019-09-08 05:22:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:22:52,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:52,664 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:52,665 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1197041911, now seen corresponding path program 1 times [2019-09-08 05:22:52,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:52,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:52,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:52,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:22:52,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:52,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:22:52,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:22:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:22:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:22:52,942 INFO L87 Difference]: Start difference. First operand 102022 states and 182715 transitions. Second operand 18 states. [2019-09-08 05:23:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:08,752 INFO L93 Difference]: Finished difference Result 153381 states and 272690 transitions. [2019-09-08 05:23:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:23:08,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 244 [2019-09-08 05:23:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:09,240 INFO L225 Difference]: With dead ends: 153381 [2019-09-08 05:23:09,240 INFO L226 Difference]: Without dead ends: 110532 [2019-09-08 05:23:09,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:23:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110532 states. [2019-09-08 05:23:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110532 to 107045. [2019-09-08 05:23:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107045 states. [2019-09-08 05:23:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107045 states to 107045 states and 191387 transitions. [2019-09-08 05:23:15,744 INFO L78 Accepts]: Start accepts. Automaton has 107045 states and 191387 transitions. Word has length 244 [2019-09-08 05:23:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:15,745 INFO L475 AbstractCegarLoop]: Abstraction has 107045 states and 191387 transitions. [2019-09-08 05:23:15,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:23:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 107045 states and 191387 transitions. [2019-09-08 05:23:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 05:23:15,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:15,940 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:15,941 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2016460587, now seen corresponding path program 1 times [2019-09-08 05:23:15,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:15,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:23:16,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:16,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:23:16,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:23:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:23:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:23:16,188 INFO L87 Difference]: Start difference. First operand 107045 states and 191387 transitions. Second operand 16 states. [2019-09-08 05:23:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:24,179 INFO L93 Difference]: Finished difference Result 170647 states and 296103 transitions. [2019-09-08 05:23:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:23:24,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 250 [2019-09-08 05:23:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:24,570 INFO L225 Difference]: With dead ends: 170647 [2019-09-08 05:23:24,570 INFO L226 Difference]: Without dead ends: 106527 [2019-09-08 05:23:24,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:23:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106527 states. [2019-09-08 05:23:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106527 to 106405. [2019-09-08 05:23:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106405 states. [2019-09-08 05:23:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106405 states to 106405 states and 189420 transitions. [2019-09-08 05:23:30,308 INFO L78 Accepts]: Start accepts. Automaton has 106405 states and 189420 transitions. Word has length 250 [2019-09-08 05:23:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:30,308 INFO L475 AbstractCegarLoop]: Abstraction has 106405 states and 189420 transitions. [2019-09-08 05:23:30,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:23:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 106405 states and 189420 transitions. [2019-09-08 05:23:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:23:30,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:30,476 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:30,476 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash -365993188, now seen corresponding path program 1 times [2019-09-08 05:23:30,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:23:30,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:23:30,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:23:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:23:30,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:23:30,654 INFO L87 Difference]: Start difference. First operand 106405 states and 189420 transitions. Second operand 5 states. [2019-09-08 05:23:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:36,557 INFO L93 Difference]: Finished difference Result 139919 states and 244368 transitions. [2019-09-08 05:23:36,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:23:36,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-09-08 05:23:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:37,015 INFO L225 Difference]: With dead ends: 139919 [2019-09-08 05:23:37,015 INFO L226 Difference]: Without dead ends: 108326 [2019-09-08 05:23:37,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:23:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108326 states. [2019-09-08 05:23:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108326 to 106930. [2019-09-08 05:23:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106930 states. [2019-09-08 05:23:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106930 states to 106930 states and 189191 transitions. [2019-09-08 05:23:43,157 INFO L78 Accepts]: Start accepts. Automaton has 106930 states and 189191 transitions. Word has length 244 [2019-09-08 05:23:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:43,158 INFO L475 AbstractCegarLoop]: Abstraction has 106930 states and 189191 transitions. [2019-09-08 05:23:43,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:23:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 106930 states and 189191 transitions. [2019-09-08 05:23:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:23:43,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:43,328 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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:23:43,328 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:43,328 INFO L82 PathProgramCache]: Analyzing trace with hash -824902347, now seen corresponding path program 1 times [2019-09-08 05:23:43,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:43,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:43,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:43,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:43,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 05:23:43,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:43,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:23:43,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:23:43,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:23:43,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:23:43,705 INFO L87 Difference]: Start difference. First operand 106930 states and 189191 transitions. Second operand 18 states. [2019-09-08 05:23:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:59,269 INFO L93 Difference]: Finished difference Result 147254 states and 256246 transitions. [2019-09-08 05:23:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:23:59,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 263 [2019-09-08 05:23:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:59,736 INFO L225 Difference]: With dead ends: 147254 [2019-09-08 05:23:59,736 INFO L226 Difference]: Without dead ends: 109829 [2019-09-08 05:23:59,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:23:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109829 states. [2019-09-08 05:24:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109829 to 106930. [2019-09-08 05:24:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106930 states. [2019-09-08 05:24:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106930 states to 106930 states and 189191 transitions. [2019-09-08 05:24:06,218 INFO L78 Accepts]: Start accepts. Automaton has 106930 states and 189191 transitions. Word has length 263 [2019-09-08 05:24:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:06,219 INFO L475 AbstractCegarLoop]: Abstraction has 106930 states and 189191 transitions. [2019-09-08 05:24:06,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:24:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 106930 states and 189191 transitions. [2019-09-08 05:24:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:24:06,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:06,394 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:06,394 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:06,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:06,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1441885841, now seen corresponding path program 1 times [2019-09-08 05:24:06,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:06,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:06,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:06,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:06,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:24:06,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:06,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:24:06,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:24:06,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:24:06,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:24:06,535 INFO L87 Difference]: Start difference. First operand 106930 states and 189191 transitions. Second operand 6 states. [2019-09-08 05:24:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:12,173 INFO L93 Difference]: Finished difference Result 213951 states and 380604 transitions. [2019-09-08 05:24:12,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:24:12,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2019-09-08 05:24:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:12,562 INFO L225 Difference]: With dead ends: 213951 [2019-09-08 05:24:12,563 INFO L226 Difference]: Without dead ends: 107110 [2019-09-08 05:24:12,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:24:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107110 states. [2019-09-08 05:24:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107110 to 107110. [2019-09-08 05:24:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107110 states. [2019-09-08 05:24:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107110 states to 107110 states and 188972 transitions. [2019-09-08 05:24:22,408 INFO L78 Accepts]: Start accepts. Automaton has 107110 states and 188972 transitions. Word has length 245 [2019-09-08 05:24:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:22,408 INFO L475 AbstractCegarLoop]: Abstraction has 107110 states and 188972 transitions. [2019-09-08 05:24:22,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:24:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 107110 states and 188972 transitions. [2019-09-08 05:24:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 05:24:22,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:22,575 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:22,575 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1240550019, now seen corresponding path program 1 times [2019-09-08 05:24:22,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:22,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:22,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:24:22,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:24:22,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:24:22,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:24:22,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:24:22,718 INFO L87 Difference]: Start difference. First operand 107110 states and 188972 transitions. Second operand 6 states. [2019-09-08 05:24:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:30,107 INFO L93 Difference]: Finished difference Result 214131 states and 387054 transitions. [2019-09-08 05:24:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:24:30,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 05:24:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:30,496 INFO L225 Difference]: With dead ends: 214131 [2019-09-08 05:24:30,496 INFO L226 Difference]: Without dead ends: 107110 [2019-09-08 05:24:30,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:24:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107110 states. [2019-09-08 05:24:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107110 to 107110. [2019-09-08 05:24:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107110 states. [2019-09-08 05:24:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107110 states to 107110 states and 183878 transitions. [2019-09-08 05:24:36,622 INFO L78 Accepts]: Start accepts. Automaton has 107110 states and 183878 transitions. Word has length 248 [2019-09-08 05:24:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:36,622 INFO L475 AbstractCegarLoop]: Abstraction has 107110 states and 183878 transitions. [2019-09-08 05:24:36,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:24:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 107110 states and 183878 transitions. [2019-09-08 05:24:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 05:24:36,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:36,796 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,796 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:36,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1880240891, now seen corresponding path program 1 times [2019-09-08 05:24:36,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:36,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:36,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:36,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:36,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:24:36,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:24:36,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:24:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:37,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 3064 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:24:37,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:24:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 05:24:37,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:24:37,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:24:37,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:24:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:24:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:24:37,790 INFO L87 Difference]: Start difference. First operand 107110 states and 183878 transitions. Second operand 13 states. [2019-09-08 05:24:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:48,200 INFO L93 Difference]: Finished difference Result 214168 states and 367694 transitions. [2019-09-08 05:24:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:24:48,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 277 [2019-09-08 05:24:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:48,935 INFO L225 Difference]: With dead ends: 214168 [2019-09-08 05:24:48,935 INFO L226 Difference]: Without dead ends: 107114 [2019-09-08 05:24:49,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:24:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107114 states. [2019-09-08 05:24:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107114 to 107110. [2019-09-08 05:24:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107110 states. [2019-09-08 05:24:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107110 states to 107110 states and 183876 transitions. [2019-09-08 05:24:59,435 INFO L78 Accepts]: Start accepts. Automaton has 107110 states and 183876 transitions. Word has length 277 [2019-09-08 05:24:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:59,436 INFO L475 AbstractCegarLoop]: Abstraction has 107110 states and 183876 transitions. [2019-09-08 05:24:59,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:24:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 107110 states and 183876 transitions. [2019-09-08 05:24:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 05:24:59,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:59,972 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:59,973 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2024523893, now seen corresponding path program 1 times [2019-09-08 05:24:59,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:59,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:25:00,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:25:00,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:25:00,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:25:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:25:00,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:25:00,192 INFO L87 Difference]: Start difference. First operand 107110 states and 183876 transitions. Second operand 7 states. [2019-09-08 05:25:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:06,313 INFO L93 Difference]: Finished difference Result 214142 states and 367659 transitions. [2019-09-08 05:25:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:25:06,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 261 [2019-09-08 05:25:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:06,832 INFO L225 Difference]: With dead ends: 214142 [2019-09-08 05:25:06,832 INFO L226 Difference]: Without dead ends: 107112 [2019-09-08 05:25:07,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:25:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107112 states. [2019-09-08 05:25:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107112 to 107110. [2019-09-08 05:25:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107110 states. [2019-09-08 05:25:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107110 states to 107110 states and 183875 transitions. [2019-09-08 05:25:17,901 INFO L78 Accepts]: Start accepts. Automaton has 107110 states and 183875 transitions. Word has length 261 [2019-09-08 05:25:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:17,901 INFO L475 AbstractCegarLoop]: Abstraction has 107110 states and 183875 transitions. [2019-09-08 05:25:17,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:25:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 107110 states and 183875 transitions. [2019-09-08 05:25:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 05:25:18,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:18,083 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 05:25:18,083 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1622682364, now seen corresponding path program 1 times [2019-09-08 05:25:18,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:18,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:18,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:18,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:18,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:25:18,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:25:18,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:25:18,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:25:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:18,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:25:18,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:25:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:25:19,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:25:19,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:25:19,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:25:19,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:25:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:25:19,087 INFO L87 Difference]: Start difference. First operand 107110 states and 183875 transitions. Second operand 18 states. [2019-09-08 05:25:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:25:36,907 INFO L93 Difference]: Finished difference Result 354591 states and 630686 transitions. [2019-09-08 05:25:36,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 05:25:36,907 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 280 [2019-09-08 05:25:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:25:38,119 INFO L225 Difference]: With dead ends: 354591 [2019-09-08 05:25:38,120 INFO L226 Difference]: Without dead ends: 247549 [2019-09-08 05:25:38,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=2105, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 05:25:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247549 states. [2019-09-08 05:25:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247549 to 215955. [2019-09-08 05:25:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215955 states. [2019-09-08 05:25:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215955 states to 215955 states and 373870 transitions. [2019-09-08 05:25:58,957 INFO L78 Accepts]: Start accepts. Automaton has 215955 states and 373870 transitions. Word has length 280 [2019-09-08 05:25:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:58,958 INFO L475 AbstractCegarLoop]: Abstraction has 215955 states and 373870 transitions. [2019-09-08 05:25:58,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:25:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 215955 states and 373870 transitions. [2019-09-08 05:25:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 05:25:59,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:59,371 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:59,371 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -755362372, now seen corresponding path program 1 times [2019-09-08 05:25:59,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:59,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:59,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:59,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:25:59,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:25:59,555 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:25:59,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:00,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:26:00,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:26:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:26:01,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:26:01,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:26:01,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:26:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:26:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:26:01,181 INFO L87 Difference]: Start difference. First operand 215955 states and 373870 transitions. Second operand 13 states. [2019-09-08 05:26:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:16,400 INFO L93 Difference]: Finished difference Result 432092 states and 747956 transitions. [2019-09-08 05:26:16,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:26:16,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 281 [2019-09-08 05:26:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:17,884 INFO L225 Difference]: With dead ends: 432092 [2019-09-08 05:26:17,884 INFO L226 Difference]: Without dead ends: 216249 [2019-09-08 05:26:18,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:26:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216249 states. [2019-09-08 05:26:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216249 to 215959. [2019-09-08 05:26:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215959 states. [2019-09-08 05:26:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215959 states to 215959 states and 373873 transitions. [2019-09-08 05:26:38,026 INFO L78 Accepts]: Start accepts. Automaton has 215959 states and 373873 transitions. Word has length 281 [2019-09-08 05:26:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:26:38,027 INFO L475 AbstractCegarLoop]: Abstraction has 215959 states and 373873 transitions. [2019-09-08 05:26:38,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:26:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 215959 states and 373873 transitions. [2019-09-08 05:26:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:26:39,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:26:39,611 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:39,611 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:26:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:26:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash 869328438, now seen corresponding path program 1 times [2019-09-08 05:26:39,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:26:39,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:26:39,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:39,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:26:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:26:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:26:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:26:40,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:26:40,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 05:26:40,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 05:26:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 05:26:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:26:40,056 INFO L87 Difference]: Start difference. First operand 215959 states and 373873 transitions. Second operand 20 states. [2019-09-08 05:26:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:59,760 INFO L93 Difference]: Finished difference Result 271993 states and 464368 transitions. [2019-09-08 05:26:59,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 05:26:59,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 265 [2019-09-08 05:26:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:01,292 INFO L225 Difference]: With dead ends: 271993 [2019-09-08 05:27:01,292 INFO L226 Difference]: Without dead ends: 251078 [2019-09-08 05:27:01,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 05:27:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251078 states. [2019-09-08 05:27:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251078 to 247819. [2019-09-08 05:27:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247819 states. [2019-09-08 05:27:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247819 states to 247819 states and 424285 transitions. [2019-09-08 05:27:18,332 INFO L78 Accepts]: Start accepts. Automaton has 247819 states and 424285 transitions. Word has length 265 [2019-09-08 05:27:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:18,333 INFO L475 AbstractCegarLoop]: Abstraction has 247819 states and 424285 transitions. [2019-09-08 05:27:18,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 05:27:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 247819 states and 424285 transitions. [2019-09-08 05:27:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 05:27:18,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:18,703 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:18,703 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash -975679557, now seen corresponding path program 1 times [2019-09-08 05:27:18,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:18,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:18,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:18,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:18,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 05:27:18,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:27:18,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:27:18,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:27:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:19,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:27:19,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:27:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 05:27:19,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:27:19,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:27:19,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:27:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:27:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:27:19,400 INFO L87 Difference]: Start difference. First operand 247819 states and 424285 transitions. Second operand 6 states. [2019-09-08 05:27:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:37,223 INFO L93 Difference]: Finished difference Result 416040 states and 690445 transitions. [2019-09-08 05:27:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:27:37,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 278 [2019-09-08 05:27:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:38,291 INFO L225 Difference]: With dead ends: 416040 [2019-09-08 05:27:38,291 INFO L226 Difference]: Without dead ends: 254489 [2019-09-08 05:27:38,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:27:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254489 states. [2019-09-08 05:27:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254489 to 253929. [2019-09-08 05:27:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253929 states. [2019-09-08 05:27:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253929 states to 253929 states and 435769 transitions. [2019-09-08 05:27:54,674 INFO L78 Accepts]: Start accepts. Automaton has 253929 states and 435769 transitions. Word has length 278 [2019-09-08 05:27:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:54,675 INFO L475 AbstractCegarLoop]: Abstraction has 253929 states and 435769 transitions. [2019-09-08 05:27:54,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:27:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 253929 states and 435769 transitions. [2019-09-08 05:27:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:27:55,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:55,078 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:55,078 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1467788605, now seen corresponding path program 1 times [2019-09-08 05:27:55,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:55,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:55,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:27:55,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:55,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:27:55,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:27:55,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:27:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:27:55,221 INFO L87 Difference]: Start difference. First operand 253929 states and 435769 transitions. Second operand 6 states. [2019-09-08 05:28:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:13,826 INFO L93 Difference]: Finished difference Result 501754 states and 860120 transitions. [2019-09-08 05:28:13,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:28:13,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-09-08 05:28:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:15,509 INFO L225 Difference]: With dead ends: 501754 [2019-09-08 05:28:15,510 INFO L226 Difference]: Without dead ends: 253941 [2019-09-08 05:28:16,109 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:28:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253941 states. [2019-09-08 05:28:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253941 to 253929. [2019-09-08 05:28:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253929 states. [2019-09-08 05:28:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253929 states to 253929 states and 434999 transitions. [2019-09-08 05:28:32,322 INFO L78 Accepts]: Start accepts. Automaton has 253929 states and 434999 transitions. Word has length 273 [2019-09-08 05:28:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:28:32,323 INFO L475 AbstractCegarLoop]: Abstraction has 253929 states and 434999 transitions. [2019-09-08 05:28:32,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:28:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 253929 states and 434999 transitions. [2019-09-08 05:28:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:28:32,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:28:32,735 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:32,735 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:28:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:28:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash -160358417, now seen corresponding path program 1 times [2019-09-08 05:28:32,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:28:32,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:28:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:32,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:28:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 05:28:32,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:28:32,943 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:28:32,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:28:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:28:33,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 3071 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:28:33,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:28:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 05:28:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:28:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 05:28:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:28:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:28:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:28:33,496 INFO L87 Difference]: Start difference. First operand 253929 states and 434999 transitions. Second operand 7 states. [2019-09-08 05:28:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:28:51,494 INFO L93 Difference]: Finished difference Result 439542 states and 738743 transitions. [2019-09-08 05:28:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:28:51,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2019-09-08 05:28:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:28:52,631 INFO L225 Difference]: With dead ends: 439542 [2019-09-08 05:28:52,631 INFO L226 Difference]: Without dead ends: 277991 [2019-09-08 05:28:53,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:28:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277991 states. [2019-09-08 05:29:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277991 to 277965. [2019-09-08 05:29:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277965 states. [2019-09-08 05:29:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277965 states to 277965 states and 484055 transitions. [2019-09-08 05:29:19,787 INFO L78 Accepts]: Start accepts. Automaton has 277965 states and 484055 transitions. Word has length 284 [2019-09-08 05:29:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:19,788 INFO L475 AbstractCegarLoop]: Abstraction has 277965 states and 484055 transitions. [2019-09-08 05:29:19,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:29:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 277965 states and 484055 transitions. [2019-09-08 05:29:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:29:20,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:29:20,332 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:20,333 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:29:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:29:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash -405561504, now seen corresponding path program 1 times [2019-09-08 05:29:20,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:29:20,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:29:20,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:20,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:29:20,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:29:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:29:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:29:20,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:29:20,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:29:20,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:29:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:29:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:29:20,501 INFO L87 Difference]: Start difference. First operand 277965 states and 484055 transitions. Second operand 3 states. [2019-09-08 05:29:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:29:45,308 INFO L93 Difference]: Finished difference Result 610258 states and 1084200 transitions. [2019-09-08 05:29:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:29:45,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-09-08 05:29:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:29:47,502 INFO L225 Difference]: With dead ends: 610258 [2019-09-08 05:29:47,502 INFO L226 Difference]: Without dead ends: 341615 [2019-09-08 05:29:48,064 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:29:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341615 states. [2019-09-08 05:30:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341615 to 341603. [2019-09-08 05:30:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341603 states. [2019-09-08 05:30:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341603 states to 341603 states and 616167 transitions. [2019-09-08 05:30:23,510 INFO L78 Accepts]: Start accepts. Automaton has 341603 states and 616167 transitions. Word has length 298 [2019-09-08 05:30:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:30:23,511 INFO L475 AbstractCegarLoop]: Abstraction has 341603 states and 616167 transitions. [2019-09-08 05:30:23,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:30:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 341603 states and 616167 transitions. [2019-09-08 05:30:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 05:30:24,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:30:24,423 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:30:24,423 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:30:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:30:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1853941941, now seen corresponding path program 1 times [2019-09-08 05:30:24,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:30:24,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:30:24,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:24,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:30:24,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:30:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:30:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 05:30:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:30:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:30:24,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:30:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:30:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:30:24,588 INFO L87 Difference]: Start difference. First operand 341603 states and 616167 transitions. Second operand 6 states. [2019-09-08 05:30:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:30:52,242 INFO L93 Difference]: Finished difference Result 649136 states and 1164260 transitions. [2019-09-08 05:30:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:30:52,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 304 [2019-09-08 05:30:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:30:54,458 INFO L225 Difference]: With dead ends: 649136 [2019-09-08 05:30:54,458 INFO L226 Difference]: Without dead ends: 341615 [2019-09-08 05:30:55,158 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:30:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341615 states.