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_spec1_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:54:01,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:54:01,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:54:01,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:54:01,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:54:01,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:54:01,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:54:01,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:54:01,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:54:01,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:54:01,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:54:01,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:54:01,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:54:01,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:54:01,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:54:01,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:54:01,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:54:01,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:54:01,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:54:01,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:54:01,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:54:01,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:54:01,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:54:01,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:54:01,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:54:01,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:54:01,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:54:01,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:54:01,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:54:01,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:54:01,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:54:01,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:54:01,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:54:01,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:54:01,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:54:01,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:54:01,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:54:01,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:54:01,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:54:01,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:54:01,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:54:01,176 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 12:54:01,194 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:54:01,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:54:01,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:54:01,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:54:01,196 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:54:01,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:54:01,196 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:54:01,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:54:01,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:54:01,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:54:01,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:54:01,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:54:01,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:54:01,198 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:54:01,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:54:01,198 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:54:01,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:54:01,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:54:01,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:54:01,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:54:01,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:54:01,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:54:01,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:54:01,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:54:01,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:54:01,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:54:01,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:54:01,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:54:01,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:54:01,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:54:01,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:54:01,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:54:01,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:54:01,268 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:54:01,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product26.cil.c [2019-10-02 12:54:01,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210a44258/f14d82a81ea34a65afbbdbcac22b20a7/FLAG467fea7e7 [2019-10-02 12:54:02,038 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:54:02,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product26.cil.c [2019-10-02 12:54:02,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210a44258/f14d82a81ea34a65afbbdbcac22b20a7/FLAG467fea7e7 [2019-10-02 12:54:02,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210a44258/f14d82a81ea34a65afbbdbcac22b20a7 [2019-10-02 12:54:02,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:54:02,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:54:02,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:54:02,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:54:02,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:54:02,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:54:02" (1/1) ... [2019-10-02 12:54:02,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71624622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:02, skipping insertion in model container [2019-10-02 12:54:02,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:54:02" (1/1) ... [2019-10-02 12:54:02,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:54:02,321 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:54:03,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:54:03,225 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:54:03,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:54:03,466 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:54:03,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03 WrapperNode [2019-10-02 12:54:03,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:54:03,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:54:03,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:54:03,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:54:03,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (1/1) ... [2019-10-02 12:54:03,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:54:03,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:54:03,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:54:03,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:54:03,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (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 12:54:03,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:54:03,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:54:03,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:54:03,754 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:54:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:54:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:54:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:54:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:54:03,756 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:54:03,756 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:54:03,757 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:54:03,757 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:54:03,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:54:03,758 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:54:03,758 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:54:03,759 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:54:03,761 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:54:03,761 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:54:03,761 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:54:03,761 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:54:03,762 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:54:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:54:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:54:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:54:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:54:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:54:03,763 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:54:03,764 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:54:03,764 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:54:03,764 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:54:03,764 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:54:03,764 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:54:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:54:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:54:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:54:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:54:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:54:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:54:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:54:03,767 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:54:03,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:54:03,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:54:03,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:54:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:54:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:54:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:54:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:54:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:54:03,769 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:54:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:54:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:54:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:54:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:54:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:54:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:54:03,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:54:03,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:54:03,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:54:03,772 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:54:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:54:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:54:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:54:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:54:03,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:54:03,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:54:03,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:54:03,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:54:03,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:54:03,775 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:54:03,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:54:03,776 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:54:03,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:54:03,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:54:03,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:54:03,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:54:03,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:54:03,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:54:03,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:54:03,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:54:03,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:54:03,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:54:03,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:54:03,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:54:03,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:54:03,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:54:03,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:54:03,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:54:03,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:54:03,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:54:03,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:54:03,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:54:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:54:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:54:03,781 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:54:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:54:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:54:03,782 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:54:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:54:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:54:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:54:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:54:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:54:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:54:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:54:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:54:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:54:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:54:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:54:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:54:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:54:03,786 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:54:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:54:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:54:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:54:03,787 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:54:03,788 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:54:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:54:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:54:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:54:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:54:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:54:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:54:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:54:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:54:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:54:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:54:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:54:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:54:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:54:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:54:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:54:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:54:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:54:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:54:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:54:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:54:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:54:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:54:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:54:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:54:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:54:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:54:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:54:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:54:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:54:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:54:03,806 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:54:03,806 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:54:03,806 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:54:03,806 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:54:03,806 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:54:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:54:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:54:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:54:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:54:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:54:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:54:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:54:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:54:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:54:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:54:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:54:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 12:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:54:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:54:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:54:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:54:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:54:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:54:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:54:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:54:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:54:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:54:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:54:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:54:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:54:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:54:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:54:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:54:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:54:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:54:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:54:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:54:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:54:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:54:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:54:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:54:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:54:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:54:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:54:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:54:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:54:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:54:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:54:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:54:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:54:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:54:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:54:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:54:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:54:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:54:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:54:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:54:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:54:06,024 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:54:06,025 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:54:06,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:54:06 BoogieIcfgContainer [2019-10-02 12:54:06,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:54:06,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:54:06,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:54:06,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:54:06,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:54:02" (1/3) ... [2019-10-02 12:54:06,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30af0849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:54:06, skipping insertion in model container [2019-10-02 12:54:06,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:03" (2/3) ... [2019-10-02 12:54:06,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30af0849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:54:06, skipping insertion in model container [2019-10-02 12:54:06,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:54:06" (3/3) ... [2019-10-02 12:54:06,037 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product26.cil.c [2019-10-02 12:54:06,047 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:54:06,064 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:54:06,085 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:54:06,135 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:54:06,136 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:54:06,136 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:54:06,137 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:54:06,137 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:54:06,138 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:54:06,142 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:54:06,142 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:54:06,142 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:54:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states. [2019-10-02 12:54:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:54:06,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:06,225 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] [2019-10-02 12:54:06,229 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash 249801548, now seen corresponding path program 1 times [2019-10-02 12:54:06,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:06,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:06,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:06,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:06,962 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 12:54:06,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:06,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:54:06,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:54:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:54:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:54:06,989 INFO L87 Difference]: Start difference. First operand 601 states. Second operand 2 states. [2019-10-02 12:54:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:07,078 INFO L93 Difference]: Finished difference Result 877 states and 1188 transitions. [2019-10-02 12:54:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:54:07,080 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 12:54:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:07,105 INFO L225 Difference]: With dead ends: 877 [2019-10-02 12:54:07,105 INFO L226 Difference]: Without dead ends: 572 [2019-10-02 12:54:07,113 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 12:54:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-02 12:54:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-10-02 12:54:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-10-02 12:54:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 780 transitions. [2019-10-02 12:54:07,241 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 780 transitions. Word has length 154 [2019-10-02 12:54:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:07,245 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 780 transitions. [2019-10-02 12:54:07,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:54:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 780 transitions. [2019-10-02 12:54:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:54:07,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:07,256 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] [2019-10-02 12:54:07,257 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1309331988, now seen corresponding path program 1 times [2019-10-02 12:54:07,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:07,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:07,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:07,581 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 12:54:07,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:07,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:07,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:07,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:07,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:07,585 INFO L87 Difference]: Start difference. First operand 572 states and 780 transitions. Second operand 3 states. [2019-10-02 12:54:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:07,649 INFO L93 Difference]: Finished difference Result 860 states and 1154 transitions. [2019-10-02 12:54:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:07,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 12:54:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:07,659 INFO L225 Difference]: With dead ends: 860 [2019-10-02 12:54:07,659 INFO L226 Difference]: Without dead ends: 575 [2019-10-02 12:54:07,665 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 12:54:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-02 12:54:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 574. [2019-10-02 12:54:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 12:54:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 782 transitions. [2019-10-02 12:54:07,705 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 782 transitions. Word has length 155 [2019-10-02 12:54:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:07,709 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 782 transitions. [2019-10-02 12:54:07,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 782 transitions. [2019-10-02 12:54:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:54:07,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:07,714 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 12:54:07,716 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:07,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:07,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1076372643, now seen corresponding path program 1 times [2019-10-02 12:54:07,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:07,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:07,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:07,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:07,958 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 12:54:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:07,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:07,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:07,965 INFO L87 Difference]: Start difference. First operand 574 states and 782 transitions. Second operand 3 states. [2019-10-02 12:54:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:08,011 INFO L93 Difference]: Finished difference Result 1128 states and 1568 transitions. [2019-10-02 12:54:08,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:08,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 12:54:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:08,017 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 12:54:08,017 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 12:54:08,019 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 12:54:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 12:54:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2019-10-02 12:54:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:54:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 857 transitions. [2019-10-02 12:54:08,049 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 857 transitions. Word has length 167 [2019-10-02 12:54:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:08,050 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 857 transitions. [2019-10-02 12:54:08,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 857 transitions. [2019-10-02 12:54:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:54:08,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:08,055 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 12:54:08,055 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash -55572167, now seen corresponding path program 1 times [2019-10-02 12:54:08,056 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:08,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:08,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:08,247 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 12:54:08,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:08,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:08,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:08,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:08,249 INFO L87 Difference]: Start difference. First operand 618 states and 857 transitions. Second operand 3 states. [2019-10-02 12:54:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:08,297 INFO L93 Difference]: Finished difference Result 1257 states and 1788 transitions. [2019-10-02 12:54:08,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:08,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 12:54:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:08,314 INFO L225 Difference]: With dead ends: 1257 [2019-10-02 12:54:08,315 INFO L226 Difference]: Without dead ends: 704 [2019-10-02 12:54:08,318 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 12:54:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-02 12:54:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 703. [2019-10-02 12:54:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-10-02 12:54:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1001 transitions. [2019-10-02 12:54:08,360 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1001 transitions. Word has length 168 [2019-10-02 12:54:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:08,361 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1001 transitions. [2019-10-02 12:54:08,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1001 transitions. [2019-10-02 12:54:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:54:08,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:08,366 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:08,367 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1062481768, now seen corresponding path program 1 times [2019-10-02 12:54:08,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:54:09,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:09,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-10-02 12:54:09,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 12:54:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 12:54:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:54:09,563 INFO L87 Difference]: Start difference. First operand 703 states and 1001 transitions. Second operand 35 states. [2019-10-02 12:54:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:15,883 INFO L93 Difference]: Finished difference Result 2051 states and 2980 transitions. [2019-10-02 12:54:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 12:54:15,884 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 171 [2019-10-02 12:54:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:15,893 INFO L225 Difference]: With dead ends: 2051 [2019-10-02 12:54:15,893 INFO L226 Difference]: Without dead ends: 1380 [2019-10-02 12:54:15,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=298, Invalid=4124, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 12:54:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-10-02 12:54:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1070. [2019-10-02 12:54:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-10-02 12:54:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1597 transitions. [2019-10-02 12:54:15,961 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1597 transitions. Word has length 171 [2019-10-02 12:54:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:15,962 INFO L475 AbstractCegarLoop]: Abstraction has 1070 states and 1597 transitions. [2019-10-02 12:54:15,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 12:54:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1597 transitions. [2019-10-02 12:54:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:54:15,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:15,968 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:15,968 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1787377896, now seen corresponding path program 1 times [2019-10-02 12:54:15,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:15,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:15,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:15,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:16,110 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 12:54:16,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:16,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:16,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:16,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:16,112 INFO L87 Difference]: Start difference. First operand 1070 states and 1597 transitions. Second operand 3 states. [2019-10-02 12:54:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:16,172 INFO L93 Difference]: Finished difference Result 2390 states and 3682 transitions. [2019-10-02 12:54:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:16,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 12:54:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:16,181 INFO L225 Difference]: With dead ends: 2390 [2019-10-02 12:54:16,181 INFO L226 Difference]: Without dead ends: 1399 [2019-10-02 12:54:16,186 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 12:54:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-10-02 12:54:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1398. [2019-10-02 12:54:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-10-02 12:54:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2167 transitions. [2019-10-02 12:54:16,255 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2167 transitions. Word has length 170 [2019-10-02 12:54:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:16,256 INFO L475 AbstractCegarLoop]: Abstraction has 1398 states and 2167 transitions. [2019-10-02 12:54:16,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2167 transitions. [2019-10-02 12:54:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:54:16,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:16,264 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:16,264 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash -50944113, now seen corresponding path program 1 times [2019-10-02 12:54:16,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:16,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:54:17,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:54:17,183 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 12:54:17,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:17,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:54:17,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:54:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:54:18,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:54:18,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [31] total 35 [2019-10-02 12:54:18,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 12:54:18,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 12:54:18,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:54:18,118 INFO L87 Difference]: Start difference. First operand 1398 states and 2167 transitions. Second operand 35 states. [2019-10-02 12:54:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:24,217 INFO L93 Difference]: Finished difference Result 3061 states and 4704 transitions. [2019-10-02 12:54:24,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 12:54:24,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 173 [2019-10-02 12:54:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:24,232 INFO L225 Difference]: With dead ends: 3061 [2019-10-02 12:54:24,232 INFO L226 Difference]: Without dead ends: 1714 [2019-10-02 12:54:24,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=295, Invalid=3865, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 12:54:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-10-02 12:54:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1402. [2019-10-02 12:54:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-10-02 12:54:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2172 transitions. [2019-10-02 12:54:24,318 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2172 transitions. Word has length 173 [2019-10-02 12:54:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:24,318 INFO L475 AbstractCegarLoop]: Abstraction has 1402 states and 2172 transitions. [2019-10-02 12:54:24,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 12:54:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2172 transitions. [2019-10-02 12:54:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:54:24,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:24,328 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:24,328 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2069323625, now seen corresponding path program 1 times [2019-10-02 12:54:24,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:24,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:54:25,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:25,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:54:25,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:54:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:54:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:54:25,065 INFO L87 Difference]: Start difference. First operand 1402 states and 2172 transitions. Second operand 26 states. [2019-10-02 12:54:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:34,409 INFO L93 Difference]: Finished difference Result 3922 states and 5848 transitions. [2019-10-02 12:54:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:54:34,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 174 [2019-10-02 12:54:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:34,434 INFO L225 Difference]: With dead ends: 3922 [2019-10-02 12:54:34,434 INFO L226 Difference]: Without dead ends: 3646 [2019-10-02 12:54:34,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:54:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2019-10-02 12:54:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3035. [2019-10-02 12:54:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-10-02 12:54:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4680 transitions. [2019-10-02 12:54:34,721 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4680 transitions. Word has length 174 [2019-10-02 12:54:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:34,721 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4680 transitions. [2019-10-02 12:54:34,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:54:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4680 transitions. [2019-10-02 12:54:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:54:34,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:34,750 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:34,750 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 483136297, now seen corresponding path program 1 times [2019-10-02 12:54:34,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:34,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:34,955 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 12:54:34,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:34,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:54:34,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:54:34,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:54:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:34,958 INFO L87 Difference]: Start difference. First operand 3035 states and 4680 transitions. Second operand 5 states. [2019-10-02 12:54:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:36,300 INFO L93 Difference]: Finished difference Result 6597 states and 9917 transitions. [2019-10-02 12:54:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:54:36,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-02 12:54:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:36,343 INFO L225 Difference]: With dead ends: 6597 [2019-10-02 12:54:36,343 INFO L226 Difference]: Without dead ends: 5772 [2019-10-02 12:54:36,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:54:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2019-10-02 12:54:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 5235. [2019-10-02 12:54:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5235 states. [2019-10-02 12:54:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5235 states to 5235 states and 7853 transitions. [2019-10-02 12:54:36,723 INFO L78 Accepts]: Start accepts. Automaton has 5235 states and 7853 transitions. Word has length 175 [2019-10-02 12:54:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:36,724 INFO L475 AbstractCegarLoop]: Abstraction has 5235 states and 7853 transitions. [2019-10-02 12:54:36,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:54:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5235 states and 7853 transitions. [2019-10-02 12:54:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:54:36,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:36,749 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:36,750 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1871716322, now seen corresponding path program 1 times [2019-10-02 12:54:36,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:36,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:37,088 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 12:54:37,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:37,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:54:37,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:54:37,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:54:37,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:54:37,090 INFO L87 Difference]: Start difference. First operand 5235 states and 7853 transitions. Second operand 12 states. [2019-10-02 12:54:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:37,546 INFO L93 Difference]: Finished difference Result 7959 states and 11647 transitions. [2019-10-02 12:54:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:54:37,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2019-10-02 12:54:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:37,587 INFO L225 Difference]: With dead ends: 7959 [2019-10-02 12:54:37,587 INFO L226 Difference]: Without dead ends: 5466 [2019-10-02 12:54:37,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-10-02 12:54:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 5466. [2019-10-02 12:54:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-10-02 12:54:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 8222 transitions. [2019-10-02 12:54:37,920 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 8222 transitions. Word has length 175 [2019-10-02 12:54:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:37,920 INFO L475 AbstractCegarLoop]: Abstraction has 5466 states and 8222 transitions. [2019-10-02 12:54:37,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:54:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 8222 transitions. [2019-10-02 12:54:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:54:37,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:37,939 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:37,940 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:37,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1526967544, now seen corresponding path program 1 times [2019-10-02 12:54:37,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:37,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:37,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:37,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:54:38,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:38,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:54:38,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:54:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:54:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:54:38,099 INFO L87 Difference]: Start difference. First operand 5466 states and 8222 transitions. Second operand 9 states. [2019-10-02 12:54:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:38,444 INFO L93 Difference]: Finished difference Result 6071 states and 9029 transitions. [2019-10-02 12:54:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:54:38,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-10-02 12:54:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:38,458 INFO L225 Difference]: With dead ends: 6071 [2019-10-02 12:54:38,458 INFO L226 Difference]: Without dead ends: 2044 [2019-10-02 12:54:38,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-10-02 12:54:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2042. [2019-10-02 12:54:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-10-02 12:54:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3032 transitions. [2019-10-02 12:54:38,595 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3032 transitions. Word has length 175 [2019-10-02 12:54:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:38,595 INFO L475 AbstractCegarLoop]: Abstraction has 2042 states and 3032 transitions. [2019-10-02 12:54:38,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:54:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3032 transitions. [2019-10-02 12:54:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:54:38,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:38,603 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:38,604 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1142566586, now seen corresponding path program 2 times [2019-10-02 12:54:38,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:39,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:39,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:54:39,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:54:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:54:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:54:39,164 INFO L87 Difference]: Start difference. First operand 2042 states and 3032 transitions. Second operand 24 states. [2019-10-02 12:54:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:48,802 INFO L93 Difference]: Finished difference Result 8101 states and 11991 transitions. [2019-10-02 12:54:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:54:48,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2019-10-02 12:54:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:48,862 INFO L225 Difference]: With dead ends: 8101 [2019-10-02 12:54:48,862 INFO L226 Difference]: Without dead ends: 7246 [2019-10-02 12:54:48,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:54:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7246 states. [2019-10-02 12:54:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7246 to 5461. [2019-10-02 12:54:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5461 states. [2019-10-02 12:54:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 8214 transitions. [2019-10-02 12:54:49,184 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 8214 transitions. Word has length 175 [2019-10-02 12:54:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:49,186 INFO L475 AbstractCegarLoop]: Abstraction has 5461 states and 8214 transitions. [2019-10-02 12:54:49,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:54:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 8214 transitions. [2019-10-02 12:54:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:54:49,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:49,205 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:49,205 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash -742618811, now seen corresponding path program 2 times [2019-10-02 12:54:49,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:49,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:49,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:54:49,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:54:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:54:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:54:49,364 INFO L87 Difference]: Start difference. First operand 5461 states and 8214 transitions. Second operand 7 states. [2019-10-02 12:54:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:49,643 INFO L93 Difference]: Finished difference Result 6066 states and 9021 transitions. [2019-10-02 12:54:49,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:54:49,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2019-10-02 12:54:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:49,651 INFO L225 Difference]: With dead ends: 6066 [2019-10-02 12:54:49,651 INFO L226 Difference]: Without dead ends: 2044 [2019-10-02 12:54:49,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:54:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-10-02 12:54:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2042. [2019-10-02 12:54:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-10-02 12:54:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3031 transitions. [2019-10-02 12:54:49,768 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3031 transitions. Word has length 176 [2019-10-02 12:54:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:49,769 INFO L475 AbstractCegarLoop]: Abstraction has 2042 states and 3031 transitions. [2019-10-02 12:54:49,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:54:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3031 transitions. [2019-10-02 12:54:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:54:49,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:49,781 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:49,782 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1821902112, now seen corresponding path program 3 times [2019-10-02 12:54:49,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:49,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:49,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:50,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:50,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:54:50,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:54:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:54:50,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:54:50,399 INFO L87 Difference]: Start difference. First operand 2042 states and 3031 transitions. Second operand 26 states. [2019-10-02 12:54:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:59,413 INFO L93 Difference]: Finished difference Result 8108 states and 11998 transitions. [2019-10-02 12:54:59,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:54:59,413 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 176 [2019-10-02 12:54:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:59,440 INFO L225 Difference]: With dead ends: 8108 [2019-10-02 12:54:59,440 INFO L226 Difference]: Without dead ends: 7253 [2019-10-02 12:54:59,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:54:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2019-10-02 12:54:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 5466. [2019-10-02 12:54:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-10-02 12:54:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 8219 transitions. [2019-10-02 12:54:59,792 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 8219 transitions. Word has length 176 [2019-10-02 12:54:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:59,793 INFO L475 AbstractCegarLoop]: Abstraction has 5466 states and 8219 transitions. [2019-10-02 12:54:59,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:54:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 8219 transitions. [2019-10-02 12:54:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:54:59,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:59,811 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:59,812 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1158053985, now seen corresponding path program 3 times [2019-10-02 12:54:59,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:59,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:59,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:55:00,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:00,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:55:00,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:55:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:55:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:55:00,005 INFO L87 Difference]: Start difference. First operand 5466 states and 8219 transitions. Second operand 9 states. [2019-10-02 12:55:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:00,381 INFO L93 Difference]: Finished difference Result 6073 states and 9028 transitions. [2019-10-02 12:55:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:55:00,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2019-10-02 12:55:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:00,391 INFO L225 Difference]: With dead ends: 6073 [2019-10-02 12:55:00,392 INFO L226 Difference]: Without dead ends: 2046 [2019-10-02 12:55:00,406 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:55:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2019-10-02 12:55:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2042. [2019-10-02 12:55:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-10-02 12:55:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3030 transitions. [2019-10-02 12:55:00,506 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3030 transitions. Word has length 177 [2019-10-02 12:55:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:00,507 INFO L475 AbstractCegarLoop]: Abstraction has 2042 states and 3030 transitions. [2019-10-02 12:55:00,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:55:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3030 transitions. [2019-10-02 12:55:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:55:00,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:00,515 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:00,515 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2065414920, now seen corresponding path program 1 times [2019-10-02 12:55:00,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:00,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:00,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:55:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:55:00,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:00,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:55:00,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:55:00,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:55:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:55:00,950 INFO L87 Difference]: Start difference. First operand 2042 states and 3030 transitions. Second operand 24 states. [2019-10-02 12:55:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:10,478 INFO L93 Difference]: Finished difference Result 9213 states and 13826 transitions. [2019-10-02 12:55:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 12:55:10,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 177 [2019-10-02 12:55:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:10,505 INFO L225 Difference]: With dead ends: 9213 [2019-10-02 12:55:10,505 INFO L226 Difference]: Without dead ends: 7260 [2019-10-02 12:55:10,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 12:55:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2019-10-02 12:55:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 5463. [2019-10-02 12:55:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-10-02 12:55:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 8216 transitions. [2019-10-02 12:55:10,872 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 8216 transitions. Word has length 177 [2019-10-02 12:55:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:10,873 INFO L475 AbstractCegarLoop]: Abstraction has 5463 states and 8216 transitions. [2019-10-02 12:55:10,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:55:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 8216 transitions. [2019-10-02 12:55:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:55:10,890 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:10,890 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:10,890 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:10,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2095875767, now seen corresponding path program 1 times [2019-10-02 12:55:10,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:10,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:10,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:55:11,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:11,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:55:11,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:55:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:55:11,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:55:11,041 INFO L87 Difference]: Start difference. First operand 5463 states and 8216 transitions. Second operand 7 states. [2019-10-02 12:55:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:11,296 INFO L93 Difference]: Finished difference Result 6072 states and 9028 transitions. [2019-10-02 12:55:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:55:11,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2019-10-02 12:55:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:11,303 INFO L225 Difference]: With dead ends: 6072 [2019-10-02 12:55:11,304 INFO L226 Difference]: Without dead ends: 2050 [2019-10-02 12:55:11,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:55:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2019-10-02 12:55:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2044. [2019-10-02 12:55:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-10-02 12:55:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3033 transitions. [2019-10-02 12:55:11,438 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3033 transitions. Word has length 178 [2019-10-02 12:55:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:11,439 INFO L475 AbstractCegarLoop]: Abstraction has 2044 states and 3033 transitions. [2019-10-02 12:55:11,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:55:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3033 transitions. [2019-10-02 12:55:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:55:11,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:11,448 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:11,448 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash -754942953, now seen corresponding path program 1 times [2019-10-02 12:55:11,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:11,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:11,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:11,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:55:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:55:11,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:55:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:55:11,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:55:11,845 INFO L87 Difference]: Start difference. First operand 2044 states and 3033 transitions. Second operand 18 states. [2019-10-02 12:55:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:16,493 INFO L93 Difference]: Finished difference Result 4988 states and 7272 transitions. [2019-10-02 12:55:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:55:16,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 178 [2019-10-02 12:55:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:16,511 INFO L225 Difference]: With dead ends: 4988 [2019-10-02 12:55:16,511 INFO L226 Difference]: Without dead ends: 4133 [2019-10-02 12:55:16,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:55:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2019-10-02 12:55:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4104. [2019-10-02 12:55:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-02 12:55:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6082 transitions. [2019-10-02 12:55:16,755 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6082 transitions. Word has length 178 [2019-10-02 12:55:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:16,756 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 6082 transitions. [2019-10-02 12:55:16,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:55:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6082 transitions. [2019-10-02 12:55:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:55:16,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:16,765 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:16,765 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:16,766 INFO L82 PathProgramCache]: Analyzing trace with hash 564127624, now seen corresponding path program 1 times [2019-10-02 12:55:16,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:16,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:16,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:55:16,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:55:16,915 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 12:55:17,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:17,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:55:17,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:55:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:55:17,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:55:17,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:55:17,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:55:17,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:55:17,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:55:17,564 INFO L87 Difference]: Start difference. First operand 4104 states and 6082 transitions. Second operand 5 states. [2019-10-02 12:55:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:17,809 INFO L93 Difference]: Finished difference Result 6640 states and 9563 transitions. [2019-10-02 12:55:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:55:17,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-10-02 12:55:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:17,828 INFO L225 Difference]: With dead ends: 6640 [2019-10-02 12:55:17,828 INFO L226 Difference]: Without dead ends: 4184 [2019-10-02 12:55:17,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:55:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2019-10-02 12:55:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4175. [2019-10-02 12:55:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4175 states. [2019-10-02 12:55:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 6193 transitions. [2019-10-02 12:55:18,084 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 6193 transitions. Word has length 179 [2019-10-02 12:55:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:18,084 INFO L475 AbstractCegarLoop]: Abstraction has 4175 states and 6193 transitions. [2019-10-02 12:55:18,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:55:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 6193 transitions. [2019-10-02 12:55:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:55:18,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:18,099 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:18,099 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash 522655257, now seen corresponding path program 1 times [2019-10-02 12:55:18,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:18,225 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 12:55:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:18,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:18,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:18,227 INFO L87 Difference]: Start difference. First operand 4175 states and 6193 transitions. Second operand 3 states. [2019-10-02 12:55:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:18,415 INFO L93 Difference]: Finished difference Result 9187 states and 13942 transitions. [2019-10-02 12:55:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:18,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-10-02 12:55:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:18,433 INFO L225 Difference]: With dead ends: 9187 [2019-10-02 12:55:18,433 INFO L226 Difference]: Without dead ends: 5132 [2019-10-02 12:55:18,444 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 12:55:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5132 states. [2019-10-02 12:55:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5132 to 5129. [2019-10-02 12:55:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5129 states. [2019-10-02 12:55:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 7866 transitions. [2019-10-02 12:55:18,745 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 7866 transitions. Word has length 177 [2019-10-02 12:55:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:18,745 INFO L475 AbstractCegarLoop]: Abstraction has 5129 states and 7866 transitions. [2019-10-02 12:55:18,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 7866 transitions. [2019-10-02 12:55:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:55:18,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:18,757 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:18,757 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash 102045391, now seen corresponding path program 1 times [2019-10-02 12:55:18,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:18,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:18,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:18,979 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 12:55:18,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:18,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:18,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:18,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:18,981 INFO L87 Difference]: Start difference. First operand 5129 states and 7866 transitions. Second operand 3 states. [2019-10-02 12:55:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:19,255 INFO L93 Difference]: Finished difference Result 11959 states and 18796 transitions. [2019-10-02 12:55:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:19,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 12:55:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:19,279 INFO L225 Difference]: With dead ends: 11959 [2019-10-02 12:55:19,279 INFO L226 Difference]: Without dead ends: 6962 [2019-10-02 12:55:19,293 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 12:55:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2019-10-02 12:55:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 6959. [2019-10-02 12:55:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6959 states. [2019-10-02 12:55:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 11039 transitions. [2019-10-02 12:55:19,664 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 11039 transitions. Word has length 178 [2019-10-02 12:55:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:19,665 INFO L475 AbstractCegarLoop]: Abstraction has 6959 states and 11039 transitions. [2019-10-02 12:55:19,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 11039 transitions. [2019-10-02 12:55:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:55:19,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:19,682 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:19,682 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1498184313, now seen corresponding path program 1 times [2019-10-02 12:55:19,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:55:19,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:19,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:19,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:19,801 INFO L87 Difference]: Start difference. First operand 6959 states and 11039 transitions. Second operand 3 states. [2019-10-02 12:55:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:20,155 INFO L93 Difference]: Finished difference Result 17285 states and 28102 transitions. [2019-10-02 12:55:20,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:20,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-10-02 12:55:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:20,192 INFO L225 Difference]: With dead ends: 17285 [2019-10-02 12:55:20,192 INFO L226 Difference]: Without dead ends: 10468 [2019-10-02 12:55:20,213 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 12:55:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10468 states. [2019-10-02 12:55:20,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10468 to 10465. [2019-10-02 12:55:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10465 states. [2019-10-02 12:55:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10465 states to 10465 states and 17136 transitions. [2019-10-02 12:55:20,965 INFO L78 Accepts]: Start accepts. Automaton has 10465 states and 17136 transitions. Word has length 179 [2019-10-02 12:55:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:20,966 INFO L475 AbstractCegarLoop]: Abstraction has 10465 states and 17136 transitions. [2019-10-02 12:55:20,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 10465 states and 17136 transitions. [2019-10-02 12:55:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:55:20,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:20,984 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:20,984 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 770443887, now seen corresponding path program 1 times [2019-10-02 12:55:20,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:20,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:20,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:20,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:20,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:21,130 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 12:55:21,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:21,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:21,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:21,133 INFO L87 Difference]: Start difference. First operand 10465 states and 17136 transitions. Second operand 3 states. [2019-10-02 12:55:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:21,682 INFO L93 Difference]: Finished difference Result 27507 states and 45904 transitions. [2019-10-02 12:55:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:21,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 12:55:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:21,724 INFO L225 Difference]: With dead ends: 27507 [2019-10-02 12:55:21,724 INFO L226 Difference]: Without dead ends: 17190 [2019-10-02 12:55:21,753 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 12:55:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17190 states. [2019-10-02 12:55:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17190 to 17187. [2019-10-02 12:55:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17187 states. [2019-10-02 12:55:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17187 states to 17187 states and 28753 transitions. [2019-10-02 12:55:23,370 INFO L78 Accepts]: Start accepts. Automaton has 17187 states and 28753 transitions. Word has length 180 [2019-10-02 12:55:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:23,371 INFO L475 AbstractCegarLoop]: Abstraction has 17187 states and 28753 transitions. [2019-10-02 12:55:23,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 17187 states and 28753 transitions. [2019-10-02 12:55:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:55:23,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:23,403 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:23,404 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2145038041, now seen corresponding path program 1 times [2019-10-02 12:55:23,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:23,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:23,522 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 12:55:23,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:23,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:23,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:23,524 INFO L87 Difference]: Start difference. First operand 17187 states and 28753 transitions. Second operand 3 states. [2019-10-02 12:55:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:24,571 INFO L93 Difference]: Finished difference Result 47089 states and 79786 transitions. [2019-10-02 12:55:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:24,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-02 12:55:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:24,663 INFO L225 Difference]: With dead ends: 47089 [2019-10-02 12:55:24,663 INFO L226 Difference]: Without dead ends: 30056 [2019-10-02 12:55:24,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 12:55:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30056 states. [2019-10-02 12:55:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30056 to 30053. [2019-10-02 12:55:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30053 states. [2019-10-02 12:55:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30053 states to 30053 states and 50834 transitions. [2019-10-02 12:55:26,257 INFO L78 Accepts]: Start accepts. Automaton has 30053 states and 50834 transitions. Word has length 181 [2019-10-02 12:55:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:26,258 INFO L475 AbstractCegarLoop]: Abstraction has 30053 states and 50834 transitions. [2019-10-02 12:55:26,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30053 states and 50834 transitions. [2019-10-02 12:55:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:55:26,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:26,306 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:26,306 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:26,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1610034703, now seen corresponding path program 1 times [2019-10-02 12:55:26,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:26,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:26,427 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 12:55:26,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:26,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:26,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:26,428 INFO L87 Difference]: Start difference. First operand 30053 states and 50834 transitions. Second operand 3 states. [2019-10-02 12:55:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:29,103 INFO L93 Difference]: Finished difference Result 84529 states and 143332 transitions. [2019-10-02 12:55:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:29,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-02 12:55:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:29,240 INFO L225 Difference]: With dead ends: 84529 [2019-10-02 12:55:29,240 INFO L226 Difference]: Without dead ends: 54638 [2019-10-02 12:55:29,291 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 12:55:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54638 states. [2019-10-02 12:55:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54638 to 54635. [2019-10-02 12:55:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54635 states. [2019-10-02 12:55:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54635 states to 54635 states and 91927 transitions. [2019-10-02 12:55:31,816 INFO L78 Accepts]: Start accepts. Automaton has 54635 states and 91927 transitions. Word has length 182 [2019-10-02 12:55:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:31,816 INFO L475 AbstractCegarLoop]: Abstraction has 54635 states and 91927 transitions. [2019-10-02 12:55:31,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 54635 states and 91927 transitions. [2019-10-02 12:55:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:55:31,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:31,858 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:31,858 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1126714567, now seen corresponding path program 1 times [2019-10-02 12:55:31,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:31,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:31,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:31,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:31,974 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 12:55:31,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:31,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:31,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:31,975 INFO L87 Difference]: Start difference. First operand 54635 states and 91927 transitions. Second operand 3 states. [2019-10-02 12:55:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:36,163 INFO L93 Difference]: Finished difference Result 155951 states and 263518 transitions. [2019-10-02 12:55:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:36,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-02 12:55:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:36,432 INFO L225 Difference]: With dead ends: 155951 [2019-10-02 12:55:36,432 INFO L226 Difference]: Without dead ends: 101488 [2019-10-02 12:55:36,528 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 12:55:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101488 states. [2019-10-02 12:55:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101488 to 101485. [2019-10-02 12:55:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101485 states. [2019-10-02 12:55:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101485 states to 101485 states and 170264 transitions. [2019-10-02 12:55:44,331 INFO L78 Accepts]: Start accepts. Automaton has 101485 states and 170264 transitions. Word has length 183 [2019-10-02 12:55:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:44,331 INFO L475 AbstractCegarLoop]: Abstraction has 101485 states and 170264 transitions. [2019-10-02 12:55:44,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101485 states and 170264 transitions. [2019-10-02 12:55:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:55:44,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:44,382 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:55:44,382 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:44,382 INFO L82 PathProgramCache]: Analyzing trace with hash 934314415, now seen corresponding path program 1 times [2019-10-02 12:55:44,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:44,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:44,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:44,498 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 12:55:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:44,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:44,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:44,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:44,499 INFO L87 Difference]: Start difference. First operand 101485 states and 170264 transitions. Second operand 3 states. [2019-10-02 12:55:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:53,700 INFO L93 Difference]: Finished difference Result 193020 states and 321061 transitions. [2019-10-02 12:55:53,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:53,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 12:55:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:54,431 INFO L225 Difference]: With dead ends: 193020 [2019-10-02 12:55:54,432 INFO L226 Difference]: Without dead ends: 190564 [2019-10-02 12:55:54,517 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 12:55:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190564 states. [2019-10-02 12:56:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190564 to 190561. [2019-10-02 12:56:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190561 states. [2019-10-02 12:56:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190561 states to 190561 states and 314632 transitions. [2019-10-02 12:56:08,716 INFO L78 Accepts]: Start accepts. Automaton has 190561 states and 314632 transitions. Word has length 184 [2019-10-02 12:56:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:08,717 INFO L475 AbstractCegarLoop]: Abstraction has 190561 states and 314632 transitions. [2019-10-02 12:56:08,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 190561 states and 314632 transitions. [2019-10-02 12:56:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:56:08,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:08,785 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:08,786 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:08,786 INFO L82 PathProgramCache]: Analyzing trace with hash -951482471, now seen corresponding path program 1 times [2019-10-02 12:56:08,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:08,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:08,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:08,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:08,938 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 12:56:08,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:08,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:08,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:08,940 INFO L87 Difference]: Start difference. First operand 190561 states and 314632 transitions. Second operand 3 states. [2019-10-02 12:56:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:16,420 INFO L93 Difference]: Finished difference Result 193497 states and 318688 transitions. [2019-10-02 12:56:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:16,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-02 12:56:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:17,081 INFO L225 Difference]: With dead ends: 193497 [2019-10-02 12:56:17,081 INFO L226 Difference]: Without dead ends: 191136 [2019-10-02 12:56:17,163 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 12:56:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191136 states. [2019-10-02 12:56:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191136 to 191136. [2019-10-02 12:56:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191136 states. [2019-10-02 12:56:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191136 states to 191136 states and 315429 transitions. [2019-10-02 12:56:32,122 INFO L78 Accepts]: Start accepts. Automaton has 191136 states and 315429 transitions. Word has length 185 [2019-10-02 12:56:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:32,122 INFO L475 AbstractCegarLoop]: Abstraction has 191136 states and 315429 transitions. [2019-10-02 12:56:32,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 191136 states and 315429 transitions. [2019-10-02 12:56:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-02 12:56:32,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:32,795 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:32,795 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2055794413, now seen corresponding path program 1 times [2019-10-02 12:56:32,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:32,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:32,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:32,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:32,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 12:56:32,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:32,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:56:32,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:56:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:56:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:56:32,988 INFO L87 Difference]: Start difference. First operand 191136 states and 315429 transitions. Second operand 6 states. [2019-10-02 12:56:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:52,096 INFO L93 Difference]: Finished difference Result 376882 states and 624610 transitions. [2019-10-02 12:56:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:56:52,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 317 [2019-10-02 12:56:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:53,422 INFO L225 Difference]: With dead ends: 376882 [2019-10-02 12:56:53,422 INFO L226 Difference]: Without dead ends: 373955 [2019-10-02 12:56:53,525 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 12:56:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373955 states. [2019-10-02 12:57:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373955 to 373892. [2019-10-02 12:57:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373892 states. [2019-10-02 12:57:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373892 states to 373892 states and 620521 transitions. [2019-10-02 12:57:27,434 INFO L78 Accepts]: Start accepts. Automaton has 373892 states and 620521 transitions. Word has length 317 [2019-10-02 12:57:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:27,434 INFO L475 AbstractCegarLoop]: Abstraction has 373892 states and 620521 transitions. [2019-10-02 12:57:27,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:57:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 373892 states and 620521 transitions. [2019-10-02 12:57:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-02 12:57:30,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:30,021 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:30,022 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -182301252, now seen corresponding path program 1 times [2019-10-02 12:57:30,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:30,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:30,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:30,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 12:57:30,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:30,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:57:30,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:57:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:57:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:57:30,222 INFO L87 Difference]: Start difference. First operand 373892 states and 620521 transitions. Second operand 9 states. [2019-10-02 12:57:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:50,796 INFO L93 Difference]: Finished difference Result 379613 states and 628249 transitions. [2019-10-02 12:57:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:57:50,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 318 [2019-10-02 12:57:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:52,765 INFO L225 Difference]: With dead ends: 379613 [2019-10-02 12:57:52,765 INFO L226 Difference]: Without dead ends: 373640 [2019-10-02 12:57:52,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:57:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373640 states. [2019-10-02 12:58:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373640 to 373598. [2019-10-02 12:58:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373598 states. [2019-10-02 12:58:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373598 states to 373598 states and 619996 transitions. [2019-10-02 12:58:30,998 INFO L78 Accepts]: Start accepts. Automaton has 373598 states and 619996 transitions. Word has length 318 [2019-10-02 12:58:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:30,998 INFO L475 AbstractCegarLoop]: Abstraction has 373598 states and 619996 transitions. [2019-10-02 12:58:30,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:58:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 373598 states and 619996 transitions. [2019-10-02 12:58:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:58:32,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:32,379 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:32,379 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1031073564, now seen corresponding path program 1 times [2019-10-02 12:58:32,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:32,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:32,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:58:33,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:33,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:58:33,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:58:33,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:58:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:58:33,241 INFO L87 Difference]: Start difference. First operand 373598 states and 619996 transitions. Second operand 5 states. [2019-10-02 12:58:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:55,581 INFO L93 Difference]: Finished difference Result 376898 states and 624373 transitions. [2019-10-02 12:58:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:58:55,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-10-02 12:58:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:56,628 INFO L225 Difference]: With dead ends: 376898 [2019-10-02 12:58:56,628 INFO L226 Difference]: Without dead ends: 373346 [2019-10-02 12:58:56,719 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 12:58:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373346 states. [2019-10-02 12:59:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373346 to 372722. [2019-10-02 12:59:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372722 states. [2019-10-02 12:59:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372722 states to 372722 states and 618803 transitions. [2019-10-02 12:59:29,913 INFO L78 Accepts]: Start accepts. Automaton has 372722 states and 618803 transitions. Word has length 310 [2019-10-02 12:59:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:29,914 INFO L475 AbstractCegarLoop]: Abstraction has 372722 states and 618803 transitions. [2019-10-02 12:59:29,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:59:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 372722 states and 618803 transitions. [2019-10-02 12:59:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:59:31,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:31,434 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:31,435 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 377715887, now seen corresponding path program 1 times [2019-10-02 12:59:31,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:31,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:31,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:31,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:59:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:31,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:59:31,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:59:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:59:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:59:31,664 INFO L87 Difference]: Start difference. First operand 372722 states and 618803 transitions. Second operand 11 states. [2019-10-02 13:00:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:00,606 INFO L93 Difference]: Finished difference Result 379511 states and 627986 transitions. [2019-10-02 13:00:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:00:00,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 311 [2019-10-02 13:00:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:01,893 INFO L225 Difference]: With dead ends: 379511 [2019-10-02 13:00:01,894 INFO L226 Difference]: Without dead ends: 375601 [2019-10-02 13:00:02,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:00:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375601 states. [2019-10-02 13:00:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375601 to 375450. [2019-10-02 13:00:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375450 states. [2019-10-02 13:00:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375450 states to 375450 states and 622498 transitions. [2019-10-02 13:00:42,544 INFO L78 Accepts]: Start accepts. Automaton has 375450 states and 622498 transitions. Word has length 311 [2019-10-02 13:00:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:42,545 INFO L475 AbstractCegarLoop]: Abstraction has 375450 states and 622498 transitions. [2019-10-02 13:00:42,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:00:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 375450 states and 622498 transitions. [2019-10-02 13:00:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 13:00:45,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:45,268 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-10-02 13:00:45,269 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1771670210, now seen corresponding path program 1 times [2019-10-02 13:00:45,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:45,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:45,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:45,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:45,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 13:00:45,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:45,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:00:45,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:00:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:00:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:00:45,475 INFO L87 Difference]: Start difference. First operand 375450 states and 622498 transitions. Second operand 7 states. [2019-10-02 13:01:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:12,861 INFO L93 Difference]: Finished difference Result 742527 states and 1240849 transitions. [2019-10-02 13:01:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:01:12,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 358 [2019-10-02 13:01:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:14,083 INFO L225 Difference]: With dead ends: 742527 [2019-10-02 13:01:14,083 INFO L226 Difference]: Without dead ends: 375504 [2019-10-02 13:01:14,629 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 13:01:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375504 states. [2019-10-02 13:01:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375504 to 375504. [2019-10-02 13:01:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375504 states. [2019-10-02 13:01:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375504 states to 375504 states and 622564 transitions. [2019-10-02 13:01:51,764 INFO L78 Accepts]: Start accepts. Automaton has 375504 states and 622564 transitions. Word has length 358 [2019-10-02 13:01:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:51,765 INFO L475 AbstractCegarLoop]: Abstraction has 375504 states and 622564 transitions. [2019-10-02 13:01:51,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:01:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 375504 states and 622564 transitions. [2019-10-02 13:02:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 13:02:04,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:04,164 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-10-02 13:02:04,164 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -614872112, now seen corresponding path program 1 times [2019-10-02 13:02:04,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:04,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 13:02:04,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:02:04,355 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 13:02:04,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:05,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 3721 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:02:05,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:02:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 13:02:05,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:02:05,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 13:02:05,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:02:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:02:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:02:05,148 INFO L87 Difference]: Start difference. First operand 375504 states and 622564 transitions. Second operand 10 states. [2019-10-02 13:02:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:24,316 INFO L93 Difference]: Finished difference Result 385020 states and 635726 transitions. [2019-10-02 13:02:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:02:24,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 357 [2019-10-02 13:02:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:25,496 INFO L225 Difference]: With dead ends: 385020 [2019-10-02 13:02:25,497 INFO L226 Difference]: Without dead ends: 377345 [2019-10-02 13:02:25,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 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 13:02:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377345 states. [2019-10-02 13:03:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377345 to 377142. [2019-10-02 13:03:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377142 states. [2019-10-02 13:03:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377142 states to 377142 states and 624857 transitions. [2019-10-02 13:03:02,310 INFO L78 Accepts]: Start accepts. Automaton has 377142 states and 624857 transitions. Word has length 357 [2019-10-02 13:03:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:02,310 INFO L475 AbstractCegarLoop]: Abstraction has 377142 states and 624857 transitions. [2019-10-02 13:03:02,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:03:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 377142 states and 624857 transitions. [2019-10-02 13:03:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 13:03:05,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:05,083 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:03:05,083 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash 137645883, now seen corresponding path program 1 times [2019-10-02 13:03:05,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:05,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:05,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 13:03:05,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:03:05,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:03:05,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:03:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:03:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:03:05,270 INFO L87 Difference]: Start difference. First operand 377142 states and 624857 transitions. Second operand 6 states. [2019-10-02 13:03:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:33,030 INFO L93 Difference]: Finished difference Result 752600 states and 1247291 transitions. [2019-10-02 13:03:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:03:33,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 375 [2019-10-02 13:03:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:34,780 INFO L225 Difference]: With dead ends: 752600 [2019-10-02 13:03:34,780 INFO L226 Difference]: Without dead ends: 377148 [2019-10-02 13:03:35,307 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 13:03:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377148 states. [2019-10-02 13:04:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377148 to 377142. [2019-10-02 13:04:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377142 states. [2019-10-02 13:04:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377142 states to 377142 states and 618904 transitions. [2019-10-02 13:04:09,860 INFO L78 Accepts]: Start accepts. Automaton has 377142 states and 618904 transitions. Word has length 375 [2019-10-02 13:04:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:09,861 INFO L475 AbstractCegarLoop]: Abstraction has 377142 states and 618904 transitions. [2019-10-02 13:04:09,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:04:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 377142 states and 618904 transitions. [2019-10-02 13:04:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 13:04:11,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:11,467 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:04:11,467 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -884756884, now seen corresponding path program 1 times [2019-10-02 13:04:11,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:11,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:11,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 13:04:12,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:04:12,801 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 13:04:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:13,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 3777 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 13:04:13,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:04:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 13:04:13,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:04:13,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 13:04:13,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:04:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:04:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:04:13,629 INFO L87 Difference]: Start difference. First operand 377142 states and 618904 transitions. Second operand 13 states.