java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:03:05,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:03:05,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:03:05,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:03:05,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:03:05,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:03:05,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:03:05,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:03:05,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:03:05,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:03:05,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:03:05,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:03:05,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:03:05,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:03:05,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:03:05,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:03:05,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:03:05,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:03:05,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:03:05,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:03:05,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:03:05,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:03:05,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:03:05,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:03:05,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:03:05,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:03:05,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:03:05,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:03:05,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:03:05,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:03:05,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:03:05,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:03:05,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:03:05,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:03:05,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:03:05,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:03:05,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:03:05,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:03:05,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:03:05,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:03:05,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:03:05,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:03:05,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:03:05,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:03:05,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:03:05,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:03:05,888 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:03:05,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:03:05,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:03:05,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:03:05,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:03:05,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:03:05,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:03:05,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:03:05,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:03:05,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:03:05,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:03:05,891 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:03:05,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:03:05,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:03:05,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:03:05,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:03:05,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:03:05,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:03:05,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:03:05,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:03:05,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:03:05,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:03:05,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:03:05,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:03:05,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:03:05,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:03:05,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:03:05,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:03:05,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:03:05,946 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:03:05,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c [2019-10-02 14:03:06,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e77b31f/566f42ae32724f149b14459fc70dd4c8/FLAG978769545 [2019-10-02 14:03:06,626 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:03:06,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product34.cil.c [2019-10-02 14:03:06,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e77b31f/566f42ae32724f149b14459fc70dd4c8/FLAG978769545 [2019-10-02 14:03:06,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e77b31f/566f42ae32724f149b14459fc70dd4c8 [2019-10-02 14:03:06,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:03:06,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:03:06,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:03:06,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:03:06,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:03:06,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:03:06" (1/1) ... [2019-10-02 14:03:06,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecb8b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:06, skipping insertion in model container [2019-10-02 14:03:06,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:03:06" (1/1) ... [2019-10-02 14:03:06,853 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:03:06,943 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:03:07,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:03:07,816 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:03:07,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:03:08,077 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:03:08,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08 WrapperNode [2019-10-02 14:03:08,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:03:08,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:03:08,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:03:08,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:03:08,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... [2019-10-02 14:03:08,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:03:08,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:03:08,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:03:08,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:03:08,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:03:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:03:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:03:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:03:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:03:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:03:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:03:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:03:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:03:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:03:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:03:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:03:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:03:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:03:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:03:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:03:08,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:03:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:03:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:03:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:03:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:03:08,365 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:03:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:03:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:03:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:03:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:03:08,366 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:03:08,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:03:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 14:03:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 14:03:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:03:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:03:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:03:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:03:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:03:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:03:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:03:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:03:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:03:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:03:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:03:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:03:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:03:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:03:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:03:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:03:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:03:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:03:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:03:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:03:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:03:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:03:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:03:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:03:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:03:08,372 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:03:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:03:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:03:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:03:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 14:03:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:03:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:03:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:03:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:03:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:03:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:03:08,375 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:03:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:03:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:03:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:03:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:03:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:03:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:03:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:03:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:03:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:03:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:03:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:03:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:03:08,378 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:03:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:03:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:03:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:03:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:03:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:03:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 14:03:08,380 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:03:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:03:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:03:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:03:08,381 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:03:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:03:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:03:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:03:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:03:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:03:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:03:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:03:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:03:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:03:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:03:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:03:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:03:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:03:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:03:08,384 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:03:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:03:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:03:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:03:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:03:08,385 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:03:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:03:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:03:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:03:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:03:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:03:08,386 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:03:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:03:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:03:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:03:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:03:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:03:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:03:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:03:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:03:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:03:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:03:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:03:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:03:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:03:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:03:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:03:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 14:03:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 14:03:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:03:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:03:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:03:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:03:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:03:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:03:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:03:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:03:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:03:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:03:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:03:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:03:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:03:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:03:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:03:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:03:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:03:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:03:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:03:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:03:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:03:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:03:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:03:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:03:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:03:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:03:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:03:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:03:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:03:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:03:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:03:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:03:08,395 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:03:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:03:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:03:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:03:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:03:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:03:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:03:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:03:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:03:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:03:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:03:08,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:03:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:03:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:03:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:03:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:03:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:03:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:03:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:03:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:03:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:03:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:03:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:03:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:03:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:03:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:03:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:03:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:03:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:03:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:03:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:03:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:03:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:03:08,401 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:03:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:03:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:03:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:03:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:03:08,402 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 14:03:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 14:03:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 14:03:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 14:03:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 14:03:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:03:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:03:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:03:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:03:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:03:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:03:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:03:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:03:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:03:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:03:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 14:03:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 14:03:08,405 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:03:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:03:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:03:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:03:10,764 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:03:10,764 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:03:10,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:03:10 BoogieIcfgContainer [2019-10-02 14:03:10,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:03:10,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:03:10,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:03:10,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:03:10,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:03:06" (1/3) ... [2019-10-02 14:03:10,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449602c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:03:10, skipping insertion in model container [2019-10-02 14:03:10,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:08" (2/3) ... [2019-10-02 14:03:10,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449602c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:03:10, skipping insertion in model container [2019-10-02 14:03:10,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:03:10" (3/3) ... [2019-10-02 14:03:10,774 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product34.cil.c [2019-10-02 14:03:10,785 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:03:10,796 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:03:10,814 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:03:10,853 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:03:10,853 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:03:10,854 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:03:10,854 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:03:10,854 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:03:10,854 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:03:10,854 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:03:10,854 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:03:10,854 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:03:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states. [2019-10-02 14:03:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 14:03:10,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:10,911 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:10,913 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash -794584526, now seen corresponding path program 1 times [2019-10-02 14:03:10,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:03:11,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:11,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:03:11,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:03:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:03:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:03:11,718 INFO L87 Difference]: Start difference. First operand 655 states. Second operand 2 states. [2019-10-02 14:03:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:11,818 INFO L93 Difference]: Finished difference Result 996 states and 1339 transitions. [2019-10-02 14:03:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:03:11,819 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-10-02 14:03:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:11,866 INFO L225 Difference]: With dead ends: 996 [2019-10-02 14:03:11,866 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 14:03:11,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:03:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 14:03:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 14:03:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 14:03:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 848 transitions. [2019-10-02 14:03:11,983 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 848 transitions. Word has length 167 [2019-10-02 14:03:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:11,986 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 848 transitions. [2019-10-02 14:03:11,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:03:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 848 transitions. [2019-10-02 14:03:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:03:11,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:11,993 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:11,994 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -54617500, now seen corresponding path program 1 times [2019-10-02 14:03:11,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:11,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:03:12,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:12,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:03:12,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:03:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:03:12,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:12,272 INFO L87 Difference]: Start difference. First operand 626 states and 848 transitions. Second operand 3 states. [2019-10-02 14:03:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:12,338 INFO L93 Difference]: Finished difference Result 979 states and 1304 transitions. [2019-10-02 14:03:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:03:12,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 14:03:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:12,345 INFO L225 Difference]: With dead ends: 979 [2019-10-02 14:03:12,346 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 14:03:12,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 14:03:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 628. [2019-10-02 14:03:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-02 14:03:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 850 transitions. [2019-10-02 14:03:12,406 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 850 transitions. Word has length 168 [2019-10-02 14:03:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:12,407 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 850 transitions. [2019-10-02 14:03:12,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:03:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 850 transitions. [2019-10-02 14:03:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:03:12,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:12,417 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:12,417 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1390838960, now seen corresponding path program 1 times [2019-10-02 14:03:12,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:03:12,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:12,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:03:12,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:03:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:03:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:12,716 INFO L87 Difference]: Start difference. First operand 628 states and 850 transitions. Second operand 3 states. [2019-10-02 14:03:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:12,788 INFO L93 Difference]: Finished difference Result 1234 states and 1701 transitions. [2019-10-02 14:03:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:03:12,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-02 14:03:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:12,798 INFO L225 Difference]: With dead ends: 1234 [2019-10-02 14:03:12,799 INFO L226 Difference]: Without dead ends: 671 [2019-10-02 14:03:12,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-02 14:03:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 670. [2019-10-02 14:03:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 14:03:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 922 transitions. [2019-10-02 14:03:12,869 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 922 transitions. Word has length 174 [2019-10-02 14:03:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:12,872 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 922 transitions. [2019-10-02 14:03:12,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:03:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 922 transitions. [2019-10-02 14:03:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 14:03:12,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:12,882 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:12,883 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -557359296, now seen corresponding path program 1 times [2019-10-02 14:03:12,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:12,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:03:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:13,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:03:13,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:03:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:03:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:13,256 INFO L87 Difference]: Start difference. First operand 670 states and 922 transitions. Second operand 3 states. [2019-10-02 14:03:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:13,321 INFO L93 Difference]: Finished difference Result 1148 states and 1566 transitions. [2019-10-02 14:03:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:03:13,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 14:03:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:13,333 INFO L225 Difference]: With dead ends: 1148 [2019-10-02 14:03:13,333 INFO L226 Difference]: Without dead ends: 811 [2019-10-02 14:03:13,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-02 14:03:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 810. [2019-10-02 14:03:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-10-02 14:03:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1119 transitions. [2019-10-02 14:03:13,404 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1119 transitions. Word has length 175 [2019-10-02 14:03:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:13,405 INFO L475 AbstractCegarLoop]: Abstraction has 810 states and 1119 transitions. [2019-10-02 14:03:13,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:03:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1119 transitions. [2019-10-02 14:03:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-02 14:03:13,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:13,413 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:13,413 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash -203609441, now seen corresponding path program 1 times [2019-10-02 14:03:13,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:13,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:03:13,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:13,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:03:13,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:03:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:03:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:03:13,860 INFO L87 Difference]: Start difference. First operand 810 states and 1119 transitions. Second operand 6 states. [2019-10-02 14:03:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:14,692 INFO L93 Difference]: Finished difference Result 2010 states and 2769 transitions. [2019-10-02 14:03:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:03:14,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 320 [2019-10-02 14:03:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:14,703 INFO L225 Difference]: With dead ends: 2010 [2019-10-02 14:03:14,704 INFO L226 Difference]: Without dead ends: 1571 [2019-10-02 14:03:14,706 INFO L640 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-10-02 14:03:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-10-02 14:03:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1560. [2019-10-02 14:03:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-02 14:03:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2174 transitions. [2019-10-02 14:03:14,799 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2174 transitions. Word has length 320 [2019-10-02 14:03:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:14,802 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2174 transitions. [2019-10-02 14:03:14,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:03:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2174 transitions. [2019-10-02 14:03:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-02 14:03:14,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:14,818 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:14,819 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash 72654355, now seen corresponding path program 1 times [2019-10-02 14:03:14,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:14,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:14,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:14,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:14,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:03:15,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:15,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:03:15,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:03:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:03:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:03:15,247 INFO L87 Difference]: Start difference. First operand 1560 states and 2174 transitions. Second operand 11 states. [2019-10-02 14:03:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:15,899 INFO L93 Difference]: Finished difference Result 2435 states and 3327 transitions. [2019-10-02 14:03:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:03:15,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 321 [2019-10-02 14:03:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:15,912 INFO L225 Difference]: With dead ends: 2435 [2019-10-02 14:03:15,912 INFO L226 Difference]: Without dead ends: 1534 [2019-10-02 14:03:15,916 INFO L640 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-10-02 14:03:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2019-10-02 14:03:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1530. [2019-10-02 14:03:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2019-10-02 14:03:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2123 transitions. [2019-10-02 14:03:16,012 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2123 transitions. Word has length 321 [2019-10-02 14:03:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:16,013 INFO L475 AbstractCegarLoop]: Abstraction has 1530 states and 2123 transitions. [2019-10-02 14:03:16,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:03:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2123 transitions. [2019-10-02 14:03:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 14:03:16,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:16,026 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:03:16,026 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 299496427, now seen corresponding path program 1 times [2019-10-02 14:03:16,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:03:16,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:03:16,763 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:03:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:17,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 3856 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:03:17,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:03:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:03:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:03:18,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:03:18,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:03:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:03:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:03:18,061 INFO L87 Difference]: Start difference. First operand 1530 states and 2123 transitions. Second operand 29 states. [2019-10-02 14:04:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:10,334 INFO L93 Difference]: Finished difference Result 10302 states and 14790 transitions. [2019-10-02 14:04:10,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 14:04:10,335 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 329 [2019-10-02 14:04:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:10,391 INFO L225 Difference]: With dead ends: 10302 [2019-10-02 14:04:10,392 INFO L226 Difference]: Without dead ends: 8571 [2019-10-02 14:04:10,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10469 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 14:04:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2019-10-02 14:04:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 8141. [2019-10-02 14:04:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8141 states. [2019-10-02 14:04:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8141 states to 8141 states and 11505 transitions. [2019-10-02 14:04:11,001 INFO L78 Accepts]: Start accepts. Automaton has 8141 states and 11505 transitions. Word has length 329 [2019-10-02 14:04:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:11,002 INFO L475 AbstractCegarLoop]: Abstraction has 8141 states and 11505 transitions. [2019-10-02 14:04:11,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:04:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8141 states and 11505 transitions. [2019-10-02 14:04:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 14:04:11,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:11,027 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:04:11,027 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1782178383, now seen corresponding path program 1 times [2019-10-02 14:04:11,028 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:11,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:04:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:04:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:04:11,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:04:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:04:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:04:11,382 INFO L87 Difference]: Start difference. First operand 8141 states and 11505 transitions. Second operand 5 states. [2019-10-02 14:04:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:11,678 INFO L93 Difference]: Finished difference Result 14621 states and 20458 transitions. [2019-10-02 14:04:11,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:04:11,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 334 [2019-10-02 14:04:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:11,732 INFO L225 Difference]: With dead ends: 14621 [2019-10-02 14:04:11,733 INFO L226 Difference]: Without dead ends: 7581 [2019-10-02 14:04:11,764 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:04:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-10-02 14:04:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7491. [2019-10-02 14:04:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2019-10-02 14:04:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 10564 transitions. [2019-10-02 14:04:12,276 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 10564 transitions. Word has length 334 [2019-10-02 14:04:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:12,277 INFO L475 AbstractCegarLoop]: Abstraction has 7491 states and 10564 transitions. [2019-10-02 14:04:12,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:04:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 10564 transitions. [2019-10-02 14:04:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 14:04:12,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:12,301 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:04:12,301 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 561728150, now seen corresponding path program 1 times [2019-10-02 14:04:12,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:12,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 14:04:12,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:04:12,770 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:04:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:14,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 3860 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:04:14,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:04:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 14:04:14,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:04:14,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:04:14,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:04:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:04:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:04:14,426 INFO L87 Difference]: Start difference. First operand 7491 states and 10564 transitions. Second operand 23 states. [2019-10-02 14:04:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:17,286 INFO L93 Difference]: Finished difference Result 15629 states and 22731 transitions. [2019-10-02 14:04:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:04:17,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 333 [2019-10-02 14:04:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:17,345 INFO L225 Difference]: With dead ends: 15629 [2019-10-02 14:04:17,345 INFO L226 Difference]: Without dead ends: 8003 [2019-10-02 14:04:17,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:04:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2019-10-02 14:04:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 7961. [2019-10-02 14:04:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-10-02 14:04:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 11342 transitions. [2019-10-02 14:04:17,815 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 11342 transitions. Word has length 333 [2019-10-02 14:04:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:04:17,816 INFO L475 AbstractCegarLoop]: Abstraction has 7961 states and 11342 transitions. [2019-10-02 14:04:17,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:04:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 11342 transitions. [2019-10-02 14:04:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:04:17,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:04:17,840 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:04:17,841 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:04:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:04:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -855782353, now seen corresponding path program 1 times [2019-10-02 14:04:17,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:04:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:04:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:17,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:04:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:04:18,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:04:18,225 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:04:18,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:04:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:04:18,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 3859 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:04:18,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:04:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:04:19,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:04:19,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:04:19,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:04:19,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:04:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:04:19,152 INFO L87 Difference]: Start difference. First operand 7961 states and 11342 transitions. Second operand 25 states. [2019-10-02 14:05:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:05,229 INFO L93 Difference]: Finished difference Result 23886 states and 34442 transitions. [2019-10-02 14:05:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:05:05,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 332 [2019-10-02 14:05:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:05,312 INFO L225 Difference]: With dead ends: 23886 [2019-10-02 14:05:05,312 INFO L226 Difference]: Without dead ends: 13213 [2019-10-02 14:05:05,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9618 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:05:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13213 states. [2019-10-02 14:05:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13213 to 11867. [2019-10-02 14:05:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11867 states. [2019-10-02 14:05:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 16944 transitions. [2019-10-02 14:05:05,943 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 16944 transitions. Word has length 332 [2019-10-02 14:05:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:05,944 INFO L475 AbstractCegarLoop]: Abstraction has 11867 states and 16944 transitions. [2019-10-02 14:05:05,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:05:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 16944 transitions. [2019-10-02 14:05:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 14:05:05,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:05,971 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:05:05,972 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:05,972 INFO L82 PathProgramCache]: Analyzing trace with hash 470741268, now seen corresponding path program 1 times [2019-10-02 14:05:05,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:05,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:05,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 14:05:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:05:06,397 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:05:06,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:07,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 3861 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:05:07,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:05:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:05:07,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:05:07,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 14:05:07,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:05:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:05:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:05:07,699 INFO L87 Difference]: Start difference. First operand 11867 states and 16944 transitions. Second operand 25 states. [2019-10-02 14:05:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:54,462 INFO L93 Difference]: Finished difference Result 33331 states and 48086 transitions. [2019-10-02 14:05:54,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 14:05:54,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 334 [2019-10-02 14:05:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:54,532 INFO L225 Difference]: With dead ends: 33331 [2019-10-02 14:05:54,533 INFO L226 Difference]: Without dead ends: 17335 [2019-10-02 14:05:54,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9615 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 14:05:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17335 states. [2019-10-02 14:05:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17335 to 15116. [2019-10-02 14:05:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15116 states. [2019-10-02 14:05:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15116 states to 15116 states and 21571 transitions. [2019-10-02 14:05:55,353 INFO L78 Accepts]: Start accepts. Automaton has 15116 states and 21571 transitions. Word has length 334 [2019-10-02 14:05:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:55,353 INFO L475 AbstractCegarLoop]: Abstraction has 15116 states and 21571 transitions. [2019-10-02 14:05:55,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 14:05:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15116 states and 21571 transitions. [2019-10-02 14:05:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-02 14:05:55,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:55,377 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:05:55,377 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash 811050348, now seen corresponding path program 1 times [2019-10-02 14:05:55,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:55,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:55,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:55,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 14:05:55,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:05:55,671 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:05:55,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:56,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 3863 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:05:56,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:05:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:05:56,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:05:56,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 14:05:56,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:05:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:05:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:05:56,735 INFO L87 Difference]: Start difference. First operand 15116 states and 21571 transitions. Second operand 14 states. [2019-10-02 14:06:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:09,696 INFO L93 Difference]: Finished difference Result 64816 states and 113661 transitions. [2019-10-02 14:06:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:06:09,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 337 [2019-10-02 14:06:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:10,042 INFO L225 Difference]: With dead ends: 64816 [2019-10-02 14:06:10,042 INFO L226 Difference]: Without dead ends: 49780 [2019-10-02 14:06:10,155 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:06:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49780 states. [2019-10-02 14:06:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49780 to 47634. [2019-10-02 14:06:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47634 states. [2019-10-02 14:06:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47634 states to 47634 states and 81876 transitions. [2019-10-02 14:06:12,525 INFO L78 Accepts]: Start accepts. Automaton has 47634 states and 81876 transitions. Word has length 337 [2019-10-02 14:06:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:12,525 INFO L475 AbstractCegarLoop]: Abstraction has 47634 states and 81876 transitions. [2019-10-02 14:06:12,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:06:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 47634 states and 81876 transitions. [2019-10-02 14:06:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-10-02 14:06:12,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:12,579 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:12,579 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash 499690104, now seen corresponding path program 1 times [2019-10-02 14:06:12,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:12,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 14:06:12,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:12,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:06:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:15,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 4033 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:06:15,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:06:15,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:15,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 14:06:15,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:06:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:06:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:06:15,366 INFO L87 Difference]: Start difference. First operand 47634 states and 81876 transitions. Second operand 12 states. [2019-10-02 14:06:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:24,104 INFO L93 Difference]: Finished difference Result 161054 states and 293460 transitions. [2019-10-02 14:06:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:06:24,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 383 [2019-10-02 14:06:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:24,795 INFO L225 Difference]: With dead ends: 161054 [2019-10-02 14:06:24,795 INFO L226 Difference]: Without dead ends: 109690 [2019-10-02 14:06:25,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:06:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109690 states. [2019-10-02 14:06:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109690 to 105436. [2019-10-02 14:06:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105436 states. [2019-10-02 14:06:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105436 states to 105436 states and 187350 transitions. [2019-10-02 14:06:32,422 INFO L78 Accepts]: Start accepts. Automaton has 105436 states and 187350 transitions. Word has length 383 [2019-10-02 14:06:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:32,423 INFO L475 AbstractCegarLoop]: Abstraction has 105436 states and 187350 transitions. [2019-10-02 14:06:32,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:06:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 105436 states and 187350 transitions. [2019-10-02 14:06:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-10-02 14:06:32,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:32,512 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:06:32,512 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:32,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:32,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1511636452, now seen corresponding path program 1 times [2019-10-02 14:06:32,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:32,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:32,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:06:32,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:06:32,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:06:32,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:06:32,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:06:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:06:32,734 INFO L87 Difference]: Start difference. First operand 105436 states and 187350 transitions. Second operand 3 states. [2019-10-02 14:06:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:39,110 INFO L93 Difference]: Finished difference Result 211471 states and 375873 transitions. [2019-10-02 14:06:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:06:39,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 369 [2019-10-02 14:06:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:39,662 INFO L225 Difference]: With dead ends: 211471 [2019-10-02 14:06:39,662 INFO L226 Difference]: Without dead ends: 106124 [2019-10-02 14:06:39,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:06:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106124 states. [2019-10-02 14:06:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106124 to 106086. [2019-10-02 14:06:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106086 states. [2019-10-02 14:06:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106086 states to 106086 states and 188557 transitions. [2019-10-02 14:06:49,896 INFO L78 Accepts]: Start accepts. Automaton has 106086 states and 188557 transitions. Word has length 369 [2019-10-02 14:06:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:49,896 INFO L475 AbstractCegarLoop]: Abstraction has 106086 states and 188557 transitions. [2019-10-02 14:06:49,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:06:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 106086 states and 188557 transitions. [2019-10-02 14:06:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-10-02 14:06:49,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:49,960 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:06:49,960 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1874015543, now seen corresponding path program 1 times [2019-10-02 14:06:49,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:49,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:06:50,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:50,492 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:06:50,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:51,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 3864 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:06:51,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 14:06:51,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:06:51,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 4] total 28 [2019-10-02 14:06:51,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:06:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:06:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:06:51,364 INFO L87 Difference]: Start difference. First operand 106086 states and 188557 transitions. Second operand 28 states. [2019-10-02 14:06:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:06:59,098 INFO L93 Difference]: Finished difference Result 239914 states and 539333 transitions. [2019-10-02 14:06:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 14:06:59,098 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 338 [2019-10-02 14:06:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:06:59,876 INFO L225 Difference]: With dead ends: 239914 [2019-10-02 14:06:59,876 INFO L226 Difference]: Without dead ends: 127839 [2019-10-02 14:07:06,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=1384, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:07:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127839 states. [2019-10-02 14:07:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127839 to 120974. [2019-10-02 14:07:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120974 states. [2019-10-02 14:07:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120974 states to 120974 states and 221331 transitions. [2019-10-02 14:07:12,752 INFO L78 Accepts]: Start accepts. Automaton has 120974 states and 221331 transitions. Word has length 338 [2019-10-02 14:07:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:12,753 INFO L475 AbstractCegarLoop]: Abstraction has 120974 states and 221331 transitions. [2019-10-02 14:07:12,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:07:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 120974 states and 221331 transitions. [2019-10-02 14:07:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-02 14:07:12,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:12,845 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:07:12,845 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -367015880, now seen corresponding path program 1 times [2019-10-02 14:07:12,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:12,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:12,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 14:07:13,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:07:13,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:07:13,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:07:13,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:07:13,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:07:13,062 INFO L87 Difference]: Start difference. First operand 120974 states and 221331 transitions. Second operand 3 states. [2019-10-02 14:07:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:22,060 INFO L93 Difference]: Finished difference Result 243125 states and 444926 transitions. [2019-10-02 14:07:22,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:07:22,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-10-02 14:07:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:22,776 INFO L225 Difference]: With dead ends: 243125 [2019-10-02 14:07:22,776 INFO L226 Difference]: Without dead ends: 122264 [2019-10-02 14:07:23,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:07:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122264 states. [2019-10-02 14:07:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122264 to 122256. [2019-10-02 14:07:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122256 states. [2019-10-02 14:07:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122256 states to 122256 states and 223688 transitions. [2019-10-02 14:07:32,496 INFO L78 Accepts]: Start accepts. Automaton has 122256 states and 223688 transitions. Word has length 373 [2019-10-02 14:07:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:32,496 INFO L475 AbstractCegarLoop]: Abstraction has 122256 states and 223688 transitions. [2019-10-02 14:07:32,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:07:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 122256 states and 223688 transitions. [2019-10-02 14:07:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-10-02 14:07:32,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:32,586 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:07:32,586 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1461615424, now seen corresponding path program 1 times [2019-10-02 14:07:32,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:32,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:32,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:32,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 14:07:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:07:32,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:07:32,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:07:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:07:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:07:32,809 INFO L87 Difference]: Start difference. First operand 122256 states and 223688 transitions. Second operand 3 states. [2019-10-02 14:07:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:39,497 INFO L93 Difference]: Finished difference Result 246870 states and 451748 transitions. [2019-10-02 14:07:39,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:07:39,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 429 [2019-10-02 14:07:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:40,026 INFO L225 Difference]: With dead ends: 246870 [2019-10-02 14:07:40,026 INFO L226 Difference]: Without dead ends: 124736 [2019-10-02 14:07:40,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:07:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124736 states. [2019-10-02 14:07:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124736 to 124728. [2019-10-02 14:07:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124728 states. [2019-10-02 14:07:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124728 states to 124728 states and 228135 transitions. [2019-10-02 14:07:52,042 INFO L78 Accepts]: Start accepts. Automaton has 124728 states and 228135 transitions. Word has length 429 [2019-10-02 14:07:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:07:52,043 INFO L475 AbstractCegarLoop]: Abstraction has 124728 states and 228135 transitions. [2019-10-02 14:07:52,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:07:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 124728 states and 228135 transitions. [2019-10-02 14:07:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-02 14:07:52,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:07:52,111 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:07:52,111 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:07:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:07:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash -785716647, now seen corresponding path program 1 times [2019-10-02 14:07:52,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:07:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:07:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:52,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:07:52,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:07:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:07:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 14:07:52,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:07:52,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:07:52,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:07:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:07:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:07:52,393 INFO L87 Difference]: Start difference. First operand 124728 states and 228135 transitions. Second operand 6 states. [2019-10-02 14:08:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:01,829 INFO L93 Difference]: Finished difference Result 249286 states and 456044 transitions. [2019-10-02 14:08:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:08:01,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 379 [2019-10-02 14:08:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:02,416 INFO L225 Difference]: With dead ends: 249286 [2019-10-02 14:08:02,416 INFO L226 Difference]: Without dead ends: 124736 [2019-10-02 14:08:02,729 INFO L640 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-10-02 14:08:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124736 states. [2019-10-02 14:08:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124736 to 124728. [2019-10-02 14:08:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124728 states. [2019-10-02 14:08:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124728 states to 124728 states and 228071 transitions. [2019-10-02 14:08:09,720 INFO L78 Accepts]: Start accepts. Automaton has 124728 states and 228071 transitions. Word has length 379 [2019-10-02 14:08:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:09,721 INFO L475 AbstractCegarLoop]: Abstraction has 124728 states and 228071 transitions. [2019-10-02 14:08:09,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:08:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 124728 states and 228071 transitions. [2019-10-02 14:08:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-10-02 14:08:09,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:09,794 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:09,794 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash 718656985, now seen corresponding path program 1 times [2019-10-02 14:08:09,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 14:08:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:11,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:08:11,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:08:11,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:08:11,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:08:11,108 INFO L87 Difference]: Start difference. First operand 124728 states and 228071 transitions. Second operand 8 states. [2019-10-02 14:08:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:29,952 INFO L93 Difference]: Finished difference Result 374908 states and 690161 transitions. [2019-10-02 14:08:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:08:29,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 405 [2019-10-02 14:08:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:30,946 INFO L225 Difference]: With dead ends: 374908 [2019-10-02 14:08:30,946 INFO L226 Difference]: Without dead ends: 250314 [2019-10-02 14:08:31,271 INFO L640 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-10-02 14:08:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250314 states. [2019-10-02 14:08:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250314 to 148435. [2019-10-02 14:08:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148435 states. [2019-10-02 14:08:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148435 states to 148435 states and 272536 transitions. [2019-10-02 14:08:48,213 INFO L78 Accepts]: Start accepts. Automaton has 148435 states and 272536 transitions. Word has length 405 [2019-10-02 14:08:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:08:48,213 INFO L475 AbstractCegarLoop]: Abstraction has 148435 states and 272536 transitions. [2019-10-02 14:08:48,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:08:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 148435 states and 272536 transitions. [2019-10-02 14:08:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-10-02 14:08:48,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:08:48,333 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:08:48,333 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:08:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:08:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2062786312, now seen corresponding path program 1 times [2019-10-02 14:08:48,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:08:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:08:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:08:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:08:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:08:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 14:08:48,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:08:48,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:08:48,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:08:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:08:48,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:48,574 INFO L87 Difference]: Start difference. First operand 148435 states and 272536 transitions. Second operand 3 states. [2019-10-02 14:08:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:08:58,596 INFO L93 Difference]: Finished difference Result 306203 states and 563578 transitions. [2019-10-02 14:08:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:08:58,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-10-02 14:08:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:08:59,274 INFO L225 Difference]: With dead ends: 306203 [2019-10-02 14:08:59,275 INFO L226 Difference]: Without dead ends: 157933 [2019-10-02 14:08:59,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:08:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157933 states. [2019-10-02 14:09:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157933 to 157923. [2019-10-02 14:09:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157923 states. [2019-10-02 14:09:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157923 states to 157923 states and 290983 transitions. [2019-10-02 14:09:16,085 INFO L78 Accepts]: Start accepts. Automaton has 157923 states and 290983 transitions. Word has length 391 [2019-10-02 14:09:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:16,086 INFO L475 AbstractCegarLoop]: Abstraction has 157923 states and 290983 transitions. [2019-10-02 14:09:16,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:09:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 157923 states and 290983 transitions. [2019-10-02 14:09:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-10-02 14:09:16,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:16,224 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:16,224 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash -77719609, now seen corresponding path program 1 times [2019-10-02 14:09:16,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:16,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-02 14:09:16,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:16,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:09:16,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:09:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:09:16,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:09:16,528 INFO L87 Difference]: Start difference. First operand 157923 states and 290983 transitions. Second operand 8 states. [2019-10-02 14:09:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:27,831 INFO L93 Difference]: Finished difference Result 315752 states and 583093 transitions. [2019-10-02 14:09:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:09:27,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 439 [2019-10-02 14:09:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:09:28,512 INFO L225 Difference]: With dead ends: 315752 [2019-10-02 14:09:28,513 INFO L226 Difference]: Without dead ends: 158043 [2019-10-02 14:09:28,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:09:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158043 states. [2019-10-02 14:09:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158043 to 158043. [2019-10-02 14:09:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158043 states. [2019-10-02 14:09:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158043 states to 158043 states and 291207 transitions. [2019-10-02 14:09:44,798 INFO L78 Accepts]: Start accepts. Automaton has 158043 states and 291207 transitions. Word has length 439 [2019-10-02 14:09:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:09:44,799 INFO L475 AbstractCegarLoop]: Abstraction has 158043 states and 291207 transitions. [2019-10-02 14:09:44,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:09:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 158043 states and 291207 transitions. [2019-10-02 14:09:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-02 14:09:45,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:09:45,835 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:09:45,835 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:09:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:09:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash -167992826, now seen corresponding path program 1 times [2019-10-02 14:09:45,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:09:45,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:09:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:45,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:09:45,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:09:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:09:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 14:09:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:09:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:09:46,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:09:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:09:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:09:46,027 INFO L87 Difference]: Start difference. First operand 158043 states and 291207 transitions. Second operand 3 states. [2019-10-02 14:09:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:09:59,388 INFO L93 Difference]: Finished difference Result 334089 states and 618932 transitions. [2019-10-02 14:09:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:09:59,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 380 [2019-10-02 14:09:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:00,252 INFO L225 Difference]: With dead ends: 334089 [2019-10-02 14:10:00,252 INFO L226 Difference]: Without dead ends: 176231 [2019-10-02 14:10:00,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176231 states. [2019-10-02 14:10:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176231 to 176221. [2019-10-02 14:10:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176221 states. [2019-10-02 14:10:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176221 states to 176221 states and 327432 transitions. [2019-10-02 14:10:11,295 INFO L78 Accepts]: Start accepts. Automaton has 176221 states and 327432 transitions. Word has length 380 [2019-10-02 14:10:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:11,295 INFO L475 AbstractCegarLoop]: Abstraction has 176221 states and 327432 transitions. [2019-10-02 14:10:11,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 176221 states and 327432 transitions. [2019-10-02 14:10:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-10-02 14:10:11,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:11,555 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:11,555 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:11,555 INFO L82 PathProgramCache]: Analyzing trace with hash -514104585, now seen corresponding path program 1 times [2019-10-02 14:10:11,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:11,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 14:10:11,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:10:11,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:10:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:10:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:11,760 INFO L87 Difference]: Start difference. First operand 176221 states and 327432 transitions. Second operand 3 states. [2019-10-02 14:10:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:10:27,446 INFO L93 Difference]: Finished difference Result 387079 states and 725038 transitions. [2019-10-02 14:10:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:10:27,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 389 [2019-10-02 14:10:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:10:29,282 INFO L225 Difference]: With dead ends: 387079 [2019-10-02 14:10:29,282 INFO L226 Difference]: Without dead ends: 211049 [2019-10-02 14:10:29,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:10:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211049 states. [2019-10-02 14:10:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211049 to 211039. [2019-10-02 14:10:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211039 states. [2019-10-02 14:10:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211039 states to 211039 states and 396809 transitions. [2019-10-02 14:10:48,418 INFO L78 Accepts]: Start accepts. Automaton has 211039 states and 396809 transitions. Word has length 389 [2019-10-02 14:10:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:10:48,418 INFO L475 AbstractCegarLoop]: Abstraction has 211039 states and 396809 transitions. [2019-10-02 14:10:48,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:10:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 211039 states and 396809 transitions. [2019-10-02 14:10:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 14:10:48,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:10:48,887 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:10:48,887 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:10:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:10:48,887 INFO L82 PathProgramCache]: Analyzing trace with hash -970752629, now seen corresponding path program 1 times [2019-10-02 14:10:48,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:10:48,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:10:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:10:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:10:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:10:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 14:10:50,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:10:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:10:50,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:10:50,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:10:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:10:50,226 INFO L87 Difference]: Start difference. First operand 211039 states and 396809 transitions. Second operand 7 states. [2019-10-02 14:11:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:06,979 INFO L93 Difference]: Finished difference Result 421986 states and 796639 transitions. [2019-10-02 14:11:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:11:06,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 390 [2019-10-02 14:11:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:08,066 INFO L225 Difference]: With dead ends: 421986 [2019-10-02 14:11:08,067 INFO L226 Difference]: Without dead ends: 211183 [2019-10-02 14:11:09,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:11:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211183 states. [2019-10-02 14:11:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211183 to 211183. [2019-10-02 14:11:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211183 states. [2019-10-02 14:11:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211183 states to 211183 states and 396985 transitions. [2019-10-02 14:11:22,083 INFO L78 Accepts]: Start accepts. Automaton has 211183 states and 396985 transitions. Word has length 390 [2019-10-02 14:11:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:22,083 INFO L475 AbstractCegarLoop]: Abstraction has 211183 states and 396985 transitions. [2019-10-02 14:11:22,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:11:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 211183 states and 396985 transitions. [2019-10-02 14:11:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-02 14:11:22,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:22,543 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:22,543 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1876206330, now seen corresponding path program 1 times [2019-10-02 14:11:22,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 14:11:22,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:22,734 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:22,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:23,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 4089 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:11:23,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 14:11:24,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:11:24,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 14:11:24,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:11:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:11:24,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:11:24,728 INFO L87 Difference]: Start difference. First operand 211183 states and 396985 transitions. Second operand 10 states. [2019-10-02 14:11:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:39,971 INFO L93 Difference]: Finished difference Result 347723 states and 647540 transitions. [2019-10-02 14:11:39,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:11:39,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 379 [2019-10-02 14:11:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:40,871 INFO L225 Difference]: With dead ends: 347723 [2019-10-02 14:11:40,871 INFO L226 Difference]: Without dead ends: 213292 [2019-10-02 14:11:41,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:11:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213292 states. [2019-10-02 14:11:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213292 to 213060. [2019-10-02 14:11:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213060 states. [2019-10-02 14:11:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213060 states to 213060 states and 398722 transitions. [2019-10-02 14:11:55,008 INFO L78 Accepts]: Start accepts. Automaton has 213060 states and 398722 transitions. Word has length 379 [2019-10-02 14:11:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:55,008 INFO L475 AbstractCegarLoop]: Abstraction has 213060 states and 398722 transitions. [2019-10-02 14:11:55,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:11:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 213060 states and 398722 transitions. [2019-10-02 14:11:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 14:11:55,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:55,556 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:55,556 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1744558957, now seen corresponding path program 1 times [2019-10-02 14:11:55,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:55,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-02 14:11:55,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:55,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:11:55,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:11:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:11:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:11:55,856 INFO L87 Difference]: Start difference. First operand 213060 states and 398722 transitions. Second operand 8 states. [2019-10-02 14:12:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:25,339 INFO L93 Difference]: Finished difference Result 637990 states and 1254931 transitions. [2019-10-02 14:12:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:12:25,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 438 [2019-10-02 14:12:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:37,522 INFO L225 Difference]: With dead ends: 637990 [2019-10-02 14:12:37,522 INFO L226 Difference]: Without dead ends: 426403 [2019-10-02 14:12:38,194 INFO L640 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-10-02 14:12:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426403 states. [2019-10-02 14:13:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426403 to 318249. [2019-10-02 14:13:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318249 states. [2019-10-02 14:13:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318249 states to 318249 states and 633197 transitions. [2019-10-02 14:13:05,484 INFO L78 Accepts]: Start accepts. Automaton has 318249 states and 633197 transitions. Word has length 438 [2019-10-02 14:13:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:05,485 INFO L475 AbstractCegarLoop]: Abstraction has 318249 states and 633197 transitions. [2019-10-02 14:13:05,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:13:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 318249 states and 633197 transitions. [2019-10-02 14:13:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-10-02 14:13:08,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:08,419 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:08,419 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -512258640, now seen corresponding path program 1 times [2019-10-02 14:13:08,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:08,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:08,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:08,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:08,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 14:13:08,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:08,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:13:08,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:13:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:13:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:13:08,742 INFO L87 Difference]: Start difference. First operand 318249 states and 633197 transitions. Second operand 8 states.