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_spec7_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:49:58,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:49:58,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:49:58,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:49:58,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:49:58,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:49:58,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:49:58,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:49:58,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:49:58,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:49:58,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:49:58,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:49:58,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:49:58,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:49:58,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:49:58,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:49:58,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:49:58,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:49:58,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:49:58,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:49:58,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:49:58,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:49:58,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:49:58,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:49:58,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:49:58,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:49:58,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:49:58,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:49:58,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:49:58,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:49:58,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:49:58,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:49:58,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:49:58,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:49:58,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:49:58,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:49:58,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:49:58,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:49:58,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:49:58,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:49:58,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:49:58,178 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 13:49:58,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:49:58,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:49:58,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:49:58,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:49:58,204 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:49:58,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:49:58,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:49:58,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:49:58,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:49:58,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:49:58,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:49:58,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:49:58,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:49:58,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:49:58,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:49:58,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:49:58,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:49:58,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:49:58,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:49:58,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:49:58,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:49:58,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:49:58,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:49:58,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:49:58,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:49:58,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:49:58,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:49:58,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:49:58,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:49:58,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:49:58,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:49:58,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:49:58,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:49:58,272 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:49:58,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product28.cil.c [2019-10-02 13:49:58,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21575b1ec/2b8810942e1d4f328ba0f31968a4324e/FLAGc260cc6cd [2019-10-02 13:49:58,910 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:49:58,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product28.cil.c [2019-10-02 13:49:58,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21575b1ec/2b8810942e1d4f328ba0f31968a4324e/FLAGc260cc6cd [2019-10-02 13:49:59,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21575b1ec/2b8810942e1d4f328ba0f31968a4324e [2019-10-02 13:49:59,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:49:59,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:49:59,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:49:59,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:49:59,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:49:59,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:49:59" (1/1) ... [2019-10-02 13:49:59,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a789f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:49:59, skipping insertion in model container [2019-10-02 13:49:59,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:49:59" (1/1) ... [2019-10-02 13:49:59,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:49:59,188 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:49:59,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:49:59,923 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:50:00,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:50:00,218 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:50:00,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00 WrapperNode [2019-10-02 13:50:00,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:50:00,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:50:00,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:50:00,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:50:00,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (1/1) ... [2019-10-02 13:50:00,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:50:00,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:50:00,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:50:00,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:50:00,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (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 13:50:00,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:50:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:50:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:50:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:50:00,491 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:50:00,492 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 13:50:00,492 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:50:00,492 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:50:00,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:50:00,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:50:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:50:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:50:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:50:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:50:00,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:50:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:50:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:50:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:50:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:50:00,494 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:50:00,495 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:50:00,495 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:50:00,495 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:50:00,495 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:50:00,496 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:50:00,496 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:50:00,496 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:50:00,496 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:50:00,496 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:50:00,497 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:50:00,497 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:50:00,497 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:50:00,497 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:50:00,497 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:50:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:50:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:50:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:50:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:50:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:50:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:50:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:50:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:50:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:50:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:50:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:50:00,500 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:50:00,500 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:50:00,500 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:50:00,500 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:50:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:50:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:50:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:50:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:50:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:50:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:50:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:50:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:50:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:50:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:50:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:50:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:50:00,503 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:50:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:50:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:50:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:50:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:50:00,504 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:50:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:50:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:50:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:50:00,505 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:50:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:50:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:50:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:50:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:50:00,506 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:50:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:50:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:50:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:50:00,507 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:50:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:50:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:50:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:50:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:50:00,508 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:50:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:50:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:50:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:50:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:50:00,509 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:50:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:50:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:50:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:50:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:50:00,510 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:50:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:50:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:50:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:50:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:50:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:50:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:50:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:50:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:50:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:50:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:50:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:50:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:50:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:50:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:50:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:50:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:50:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:50:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:50:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:50:00,515 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:50:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:50:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:50:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:50:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:50:00,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:50:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 13:50:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:50:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:50:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:50:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:50:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:50:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:50:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:50:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:50:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:50:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:50:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:50:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:50:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:50:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:50:00,520 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:50:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:50:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:50:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:50:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:50:00,521 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:50:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:50:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:50:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:50:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:50:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:50:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:50:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:50:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:50:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:50:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:50:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:50:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:50:00,524 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:50:00,525 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:50:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:50:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:50:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:50:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:50:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:50:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:50:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:50:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:50:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:50:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:50:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:50:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:50:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:50:02,773 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:50:02,774 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:50:02,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:50:02 BoogieIcfgContainer [2019-10-02 13:50:02,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:50:02,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:50:02,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:50:02,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:50:02,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:49:59" (1/3) ... [2019-10-02 13:50:02,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc0eda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:50:02, skipping insertion in model container [2019-10-02 13:50:02,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:00" (2/3) ... [2019-10-02 13:50:02,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc0eda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:50:02, skipping insertion in model container [2019-10-02 13:50:02,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:50:02" (3/3) ... [2019-10-02 13:50:02,784 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product28.cil.c [2019-10-02 13:50:02,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:50:02,806 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:50:02,824 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:50:02,862 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:50:02,863 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:50:02,863 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:50:02,863 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:50:02,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:50:02,864 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:50:02,864 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:50:02,864 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:50:02,864 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:50:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states. [2019-10-02 13:50:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 13:50:02,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:02,950 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:02,959 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 791417093, now seen corresponding path program 1 times [2019-10-02 13:50:02,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:02,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:03,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:03,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:50:03,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:50:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:50:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:50:03,755 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 2 states. [2019-10-02 13:50:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:03,873 INFO L93 Difference]: Finished difference Result 707 states and 939 transitions. [2019-10-02 13:50:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:50:03,879 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2019-10-02 13:50:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:03,913 INFO L225 Difference]: With dead ends: 707 [2019-10-02 13:50:03,913 INFO L226 Difference]: Without dead ends: 454 [2019-10-02 13:50:03,924 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 13:50:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-02 13:50:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2019-10-02 13:50:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-10-02 13:50:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 605 transitions. [2019-10-02 13:50:04,040 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 605 transitions. Word has length 182 [2019-10-02 13:50:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:04,042 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 605 transitions. [2019-10-02 13:50:04,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:50:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 605 transitions. [2019-10-02 13:50:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 13:50:04,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:04,049 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:04,049 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 34062624, now seen corresponding path program 1 times [2019-10-02 13:50:04,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:04,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:04,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:04,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:04,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:04,351 INFO L87 Difference]: Start difference. First operand 454 states and 605 transitions. Second operand 3 states. [2019-10-02 13:50:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:04,420 INFO L93 Difference]: Finished difference Result 690 states and 904 transitions. [2019-10-02 13:50:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:04,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-02 13:50:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:04,426 INFO L225 Difference]: With dead ends: 690 [2019-10-02 13:50:04,426 INFO L226 Difference]: Without dead ends: 457 [2019-10-02 13:50:04,436 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 13:50:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-10-02 13:50:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 456. [2019-10-02 13:50:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-02 13:50:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 607 transitions. [2019-10-02 13:50:04,473 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 607 transitions. Word has length 183 [2019-10-02 13:50:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:04,473 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 607 transitions. [2019-10-02 13:50:04,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 607 transitions. [2019-10-02 13:50:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 13:50:04,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:04,480 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:04,480 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2105837044, now seen corresponding path program 1 times [2019-10-02 13:50:04,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:04,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:04,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:04,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:04,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:04,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:04,736 INFO L87 Difference]: Start difference. First operand 456 states and 607 transitions. Second operand 3 states. [2019-10-02 13:50:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:04,775 INFO L93 Difference]: Finished difference Result 886 states and 1209 transitions. [2019-10-02 13:50:04,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:04,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-02 13:50:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:04,785 INFO L225 Difference]: With dead ends: 886 [2019-10-02 13:50:04,785 INFO L226 Difference]: Without dead ends: 495 [2019-10-02 13:50:04,787 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 13:50:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-02 13:50:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2019-10-02 13:50:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-02 13:50:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 673 transitions. [2019-10-02 13:50:04,833 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 673 transitions. Word has length 189 [2019-10-02 13:50:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:04,835 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 673 transitions. [2019-10-02 13:50:04,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 673 transitions. [2019-10-02 13:50:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 13:50:04,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:04,843 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:04,843 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash -89354053, now seen corresponding path program 1 times [2019-10-02 13:50:04,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:04,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:50:05,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:05,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:50:05,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:50:05,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:50:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:50:05,280 INFO L87 Difference]: Start difference. First operand 494 states and 673 transitions. Second operand 19 states. [2019-10-02 13:50:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:09,473 INFO L93 Difference]: Finished difference Result 1666 states and 2267 transitions. [2019-10-02 13:50:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 13:50:09,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2019-10-02 13:50:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:09,483 INFO L225 Difference]: With dead ends: 1666 [2019-10-02 13:50:09,484 INFO L226 Difference]: Without dead ends: 1451 [2019-10-02 13:50:09,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:50:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-02 13:50:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1419. [2019-10-02 13:50:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-10-02 13:50:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1938 transitions. [2019-10-02 13:50:09,565 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1938 transitions. Word has length 190 [2019-10-02 13:50:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:09,566 INFO L475 AbstractCegarLoop]: Abstraction has 1419 states and 1938 transitions. [2019-10-02 13:50:09,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:50:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1938 transitions. [2019-10-02 13:50:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:50:09,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:09,573 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:09,573 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2067450055, now seen corresponding path program 1 times [2019-10-02 13:50:09,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:09,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:09,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:09,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:09,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:50:09,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:50:09,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:50:09,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:50:09,782 INFO L87 Difference]: Start difference. First operand 1419 states and 1938 transitions. Second operand 11 states. [2019-10-02 13:50:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:10,163 INFO L93 Difference]: Finished difference Result 2414 states and 3259 transitions. [2019-10-02 13:50:10,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:50:10,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 191 [2019-10-02 13:50:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:10,177 INFO L225 Difference]: With dead ends: 2414 [2019-10-02 13:50:10,177 INFO L226 Difference]: Without dead ends: 1484 [2019-10-02 13:50:10,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:50:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2019-10-02 13:50:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1477. [2019-10-02 13:50:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-10-02 13:50:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2031 transitions. [2019-10-02 13:50:10,264 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2031 transitions. Word has length 191 [2019-10-02 13:50:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:10,265 INFO L475 AbstractCegarLoop]: Abstraction has 1477 states and 2031 transitions. [2019-10-02 13:50:10,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:50:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2031 transitions. [2019-10-02 13:50:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:50:10,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:10,271 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:10,272 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:10,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:10,272 INFO L82 PathProgramCache]: Analyzing trace with hash -393480967, now seen corresponding path program 1 times [2019-10-02 13:50:10,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:10,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:10,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:10,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:10,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:10,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:50:10,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:50:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:50:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:50:10,491 INFO L87 Difference]: Start difference. First operand 1477 states and 2031 transitions. Second operand 5 states. [2019-10-02 13:50:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:11,417 INFO L93 Difference]: Finished difference Result 3622 states and 4991 transitions. [2019-10-02 13:50:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:50:11,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-02 13:50:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:11,447 INFO L225 Difference]: With dead ends: 3622 [2019-10-02 13:50:11,448 INFO L226 Difference]: Without dead ends: 3145 [2019-10-02 13:50:11,452 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 13:50:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2019-10-02 13:50:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 3125. [2019-10-02 13:50:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2019-10-02 13:50:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4309 transitions. [2019-10-02 13:50:11,705 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4309 transitions. Word has length 191 [2019-10-02 13:50:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:11,708 INFO L475 AbstractCegarLoop]: Abstraction has 3125 states and 4309 transitions. [2019-10-02 13:50:11,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:50:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4309 transitions. [2019-10-02 13:50:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:50:11,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:11,718 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:11,718 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash -373143592, now seen corresponding path program 1 times [2019-10-02 13:50:11,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:11,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:11,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:11,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:11,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:12,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:12,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:50:12,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:50:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:50:12,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:50:12,038 INFO L87 Difference]: Start difference. First operand 3125 states and 4309 transitions. Second operand 7 states. [2019-10-02 13:50:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:14,233 INFO L93 Difference]: Finished difference Result 10144 states and 14343 transitions. [2019-10-02 13:50:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:50:14,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-10-02 13:50:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:14,299 INFO L225 Difference]: With dead ends: 10144 [2019-10-02 13:50:14,299 INFO L226 Difference]: Without dead ends: 7862 [2019-10-02 13:50:14,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:50:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7862 states. [2019-10-02 13:50:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7862 to 7822. [2019-10-02 13:50:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7822 states. [2019-10-02 13:50:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 10819 transitions. [2019-10-02 13:50:14,756 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 10819 transitions. Word has length 191 [2019-10-02 13:50:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:14,757 INFO L475 AbstractCegarLoop]: Abstraction has 7822 states and 10819 transitions. [2019-10-02 13:50:14,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:50:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 10819 transitions. [2019-10-02 13:50:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:50:14,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:14,767 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:14,767 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:14,768 INFO L82 PathProgramCache]: Analyzing trace with hash 960811411, now seen corresponding path program 1 times [2019-10-02 13:50:14,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:14,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:14,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:15,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:15,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:50:15,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:50:15,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:50:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:50:15,317 INFO L87 Difference]: Start difference. First operand 7822 states and 10819 transitions. Second operand 26 states. [2019-10-02 13:50:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:16,378 INFO L93 Difference]: Finished difference Result 15767 states and 22449 transitions. [2019-10-02 13:50:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:50:16,378 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-10-02 13:50:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:16,432 INFO L225 Difference]: With dead ends: 15767 [2019-10-02 13:50:16,432 INFO L226 Difference]: Without dead ends: 7467 [2019-10-02 13:50:16,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:50:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-10-02 13:50:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7197. [2019-10-02 13:50:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7197 states. [2019-10-02 13:50:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 9976 transitions. [2019-10-02 13:50:17,111 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 9976 transitions. Word has length 192 [2019-10-02 13:50:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:17,112 INFO L475 AbstractCegarLoop]: Abstraction has 7197 states and 9976 transitions. [2019-10-02 13:50:17,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:50:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 9976 transitions. [2019-10-02 13:50:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:50:17,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:17,125 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:17,125 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1419526608, now seen corresponding path program 1 times [2019-10-02 13:50:17,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:17,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:17,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:17,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:50:17,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:50:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:50:17,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:50:17,355 INFO L87 Difference]: Start difference. First operand 7197 states and 9976 transitions. Second operand 10 states. [2019-10-02 13:50:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:17,552 INFO L93 Difference]: Finished difference Result 7262 states and 10060 transitions. [2019-10-02 13:50:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:50:17,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2019-10-02 13:50:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:17,616 INFO L225 Difference]: With dead ends: 7262 [2019-10-02 13:50:17,616 INFO L226 Difference]: Without dead ends: 7187 [2019-10-02 13:50:17,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:50:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2019-10-02 13:50:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 7187. [2019-10-02 13:50:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7187 states. [2019-10-02 13:50:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7187 states to 7187 states and 9926 transitions. [2019-10-02 13:50:18,109 INFO L78 Accepts]: Start accepts. Automaton has 7187 states and 9926 transitions. Word has length 196 [2019-10-02 13:50:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:18,113 INFO L475 AbstractCegarLoop]: Abstraction has 7187 states and 9926 transitions. [2019-10-02 13:50:18,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:50:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7187 states and 9926 transitions. [2019-10-02 13:50:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:50:18,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:18,132 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:18,133 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -106874396, now seen corresponding path program 1 times [2019-10-02 13:50:18,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:18,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:18,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:18,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:50:18,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:50:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:50:18,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:50:18,357 INFO L87 Difference]: Start difference. First operand 7187 states and 9926 transitions. Second operand 5 states. [2019-10-02 13:50:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:18,748 INFO L93 Difference]: Finished difference Result 13263 states and 18050 transitions. [2019-10-02 13:50:18,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:50:18,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-10-02 13:50:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:18,800 INFO L225 Difference]: With dead ends: 13263 [2019-10-02 13:50:18,800 INFO L226 Difference]: Without dead ends: 7392 [2019-10-02 13:50:18,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:50:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-10-02 13:50:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7291. [2019-10-02 13:50:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7291 states. [2019-10-02 13:50:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 10066 transitions. [2019-10-02 13:50:19,191 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 10066 transitions. Word has length 201 [2019-10-02 13:50:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:19,191 INFO L475 AbstractCegarLoop]: Abstraction has 7291 states and 10066 transitions. [2019-10-02 13:50:19,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:50:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 10066 transitions. [2019-10-02 13:50:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:50:19,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:19,203 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:19,203 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash -530905528, now seen corresponding path program 1 times [2019-10-02 13:50:19,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:19,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:19,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:19,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:19,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:19,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:50:19,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:50:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:50:19,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:50:19,338 INFO L87 Difference]: Start difference. First operand 7291 states and 10066 transitions. Second operand 5 states. [2019-10-02 13:50:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:19,506 INFO L93 Difference]: Finished difference Result 9177 states and 12566 transitions. [2019-10-02 13:50:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:50:19,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-02 13:50:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:19,534 INFO L225 Difference]: With dead ends: 9177 [2019-10-02 13:50:19,534 INFO L226 Difference]: Without dead ends: 5691 [2019-10-02 13:50:19,552 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 13:50:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2019-10-02 13:50:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 5679. [2019-10-02 13:50:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-10-02 13:50:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 7775 transitions. [2019-10-02 13:50:19,931 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 7775 transitions. Word has length 203 [2019-10-02 13:50:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:19,932 INFO L475 AbstractCegarLoop]: Abstraction has 5679 states and 7775 transitions. [2019-10-02 13:50:19,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:50:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 7775 transitions. [2019-10-02 13:50:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:50:19,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:19,941 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:19,941 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash -927665010, now seen corresponding path program 1 times [2019-10-02 13:50:19,942 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:19,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:19,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:50:20,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:20,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:50:20,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:50:20,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:50:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:50:20,089 INFO L87 Difference]: Start difference. First operand 5679 states and 7775 transitions. Second operand 6 states. [2019-10-02 13:50:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:20,871 INFO L93 Difference]: Finished difference Result 15992 states and 21689 transitions. [2019-10-02 13:50:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:50:20,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 13:50:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:20,917 INFO L225 Difference]: With dead ends: 15992 [2019-10-02 13:50:20,917 INFO L226 Difference]: Without dead ends: 11287 [2019-10-02 13:50:20,939 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 13:50:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11287 states. [2019-10-02 13:50:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11287 to 11125. [2019-10-02 13:50:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11125 states. [2019-10-02 13:50:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11125 states to 11125 states and 15225 transitions. [2019-10-02 13:50:21,586 INFO L78 Accepts]: Start accepts. Automaton has 11125 states and 15225 transitions. Word has length 201 [2019-10-02 13:50:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:21,587 INFO L475 AbstractCegarLoop]: Abstraction has 11125 states and 15225 transitions. [2019-10-02 13:50:21,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:50:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11125 states and 15225 transitions. [2019-10-02 13:50:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:50:21,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:21,605 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:50:21,605 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1787182647, now seen corresponding path program 1 times [2019-10-02 13:50:21,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:21,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:21,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:21,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:50:21,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:50:21,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:50:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:50:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:50:21,775 INFO L87 Difference]: Start difference. First operand 11125 states and 15225 transitions. Second operand 8 states. [2019-10-02 13:50:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:23,251 INFO L93 Difference]: Finished difference Result 32906 states and 45382 transitions. [2019-10-02 13:50:23,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:50:23,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-10-02 13:50:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:23,375 INFO L225 Difference]: With dead ends: 32906 [2019-10-02 13:50:23,375 INFO L226 Difference]: Without dead ends: 23146 [2019-10-02 13:50:23,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:50:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23146 states. [2019-10-02 13:50:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23146 to 22773. [2019-10-02 13:50:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22773 states. [2019-10-02 13:50:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22773 states to 22773 states and 31350 transitions. [2019-10-02 13:50:25,325 INFO L78 Accepts]: Start accepts. Automaton has 22773 states and 31350 transitions. Word has length 221 [2019-10-02 13:50:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:25,326 INFO L475 AbstractCegarLoop]: Abstraction has 22773 states and 31350 transitions. [2019-10-02 13:50:25,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:50:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 22773 states and 31350 transitions. [2019-10-02 13:50:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:50:25,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:25,363 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:25,363 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash 880838603, now seen corresponding path program 1 times [2019-10-02 13:50:25,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:25,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:25,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:25,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:25,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:50:25,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:25,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:50:25,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:50:25,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:50:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:50:25,616 INFO L87 Difference]: Start difference. First operand 22773 states and 31350 transitions. Second operand 15 states. [2019-10-02 13:50:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:28,539 INFO L93 Difference]: Finished difference Result 32120 states and 44500 transitions. [2019-10-02 13:50:28,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:50:28,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 221 [2019-10-02 13:50:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:28,632 INFO L225 Difference]: With dead ends: 32120 [2019-10-02 13:50:28,633 INFO L226 Difference]: Without dead ends: 24947 [2019-10-02 13:50:28,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:50:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2019-10-02 13:50:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 23709. [2019-10-02 13:50:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23709 states. [2019-10-02 13:50:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23709 states to 23709 states and 32854 transitions. [2019-10-02 13:50:29,927 INFO L78 Accepts]: Start accepts. Automaton has 23709 states and 32854 transitions. Word has length 221 [2019-10-02 13:50:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:29,927 INFO L475 AbstractCegarLoop]: Abstraction has 23709 states and 32854 transitions. [2019-10-02 13:50:29,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:50:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23709 states and 32854 transitions. [2019-10-02 13:50:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:50:29,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:29,960 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:29,960 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1913967346, now seen corresponding path program 1 times [2019-10-02 13:50:29,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:29,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:29,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:50:30,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:30,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:50:30,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:50:30,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:50:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:50:30,153 INFO L87 Difference]: Start difference. First operand 23709 states and 32854 transitions. Second operand 7 states. [2019-10-02 13:50:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:35,188 INFO L93 Difference]: Finished difference Result 69460 states and 96261 transitions. [2019-10-02 13:50:35,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:50:35,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-10-02 13:50:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:35,345 INFO L225 Difference]: With dead ends: 69460 [2019-10-02 13:50:35,345 INFO L226 Difference]: Without dead ends: 49769 [2019-10-02 13:50:35,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:50:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49769 states. [2019-10-02 13:50:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49769 to 47804. [2019-10-02 13:50:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47804 states. [2019-10-02 13:50:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47804 states to 47804 states and 66413 transitions. [2019-10-02 13:50:38,667 INFO L78 Accepts]: Start accepts. Automaton has 47804 states and 66413 transitions. Word has length 222 [2019-10-02 13:50:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:38,667 INFO L475 AbstractCegarLoop]: Abstraction has 47804 states and 66413 transitions. [2019-10-02 13:50:38,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:50:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 47804 states and 66413 transitions. [2019-10-02 13:50:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:50:38,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:38,705 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:38,705 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -728337720, now seen corresponding path program 1 times [2019-10-02 13:50:38,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:38,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:50:38,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:38,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:50:38,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:50:38,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:50:38,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:50:38,957 INFO L87 Difference]: Start difference. First operand 47804 states and 66413 transitions. Second operand 15 states. [2019-10-02 13:50:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:43,082 INFO L93 Difference]: Finished difference Result 65057 states and 89851 transitions. [2019-10-02 13:50:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:50:43,082 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 222 [2019-10-02 13:50:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:43,283 INFO L225 Difference]: With dead ends: 65057 [2019-10-02 13:50:43,283 INFO L226 Difference]: Without dead ends: 49348 [2019-10-02 13:50:43,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:50:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49348 states. [2019-10-02 13:50:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49348 to 47330. [2019-10-02 13:50:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47330 states. [2019-10-02 13:50:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47330 states to 47330 states and 65432 transitions. [2019-10-02 13:50:46,774 INFO L78 Accepts]: Start accepts. Automaton has 47330 states and 65432 transitions. Word has length 222 [2019-10-02 13:50:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:46,775 INFO L475 AbstractCegarLoop]: Abstraction has 47330 states and 65432 transitions. [2019-10-02 13:50:46,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:50:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 47330 states and 65432 transitions. [2019-10-02 13:50:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:50:46,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:46,819 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:46,820 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2078162666, now seen corresponding path program 2 times [2019-10-02 13:50:46,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:46,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:50:47,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:50:47,058 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 13:50:47,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:50:47,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:50:47,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:50:47,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 2665 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:50:47,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:50:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:50:47,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:50:47,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 13:50:47,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:50:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:50:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:50:47,979 INFO L87 Difference]: Start difference. First operand 47330 states and 65432 transitions. Second operand 18 states. [2019-10-02 13:50:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:51,354 INFO L93 Difference]: Finished difference Result 95304 states and 132002 transitions. [2019-10-02 13:50:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:50:51,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 222 [2019-10-02 13:50:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:51,673 INFO L225 Difference]: With dead ends: 95304 [2019-10-02 13:50:51,674 INFO L226 Difference]: Without dead ends: 48026 [2019-10-02 13:50:51,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:50:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48026 states. [2019-10-02 13:50:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48026 to 47608. [2019-10-02 13:50:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47608 states. [2019-10-02 13:50:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47608 states to 47608 states and 65784 transitions. [2019-10-02 13:50:56,549 INFO L78 Accepts]: Start accepts. Automaton has 47608 states and 65784 transitions. Word has length 222 [2019-10-02 13:50:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:56,549 INFO L475 AbstractCegarLoop]: Abstraction has 47608 states and 65784 transitions. [2019-10-02 13:50:56,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:50:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47608 states and 65784 transitions. [2019-10-02 13:50:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:50:56,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:56,657 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:56,658 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash 406270917, now seen corresponding path program 1 times [2019-10-02 13:50:56,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:56,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:56,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:50:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:50:56,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:56,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:50:56,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:50:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:50:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:50:56,896 INFO L87 Difference]: Start difference. First operand 47608 states and 65784 transitions. Second operand 7 states. [2019-10-02 13:51:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:02,300 INFO L93 Difference]: Finished difference Result 137148 states and 189022 transitions. [2019-10-02 13:51:02,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:51:02,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-10-02 13:51:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:02,727 INFO L225 Difference]: With dead ends: 137148 [2019-10-02 13:51:02,727 INFO L226 Difference]: Without dead ends: 97468 [2019-10-02 13:51:02,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:51:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97468 states. [2019-10-02 13:51:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97468 to 93287. [2019-10-02 13:51:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93287 states. [2019-10-02 13:51:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93287 states to 93287 states and 128837 transitions. [2019-10-02 13:51:09,455 INFO L78 Accepts]: Start accepts. Automaton has 93287 states and 128837 transitions. Word has length 224 [2019-10-02 13:51:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:09,456 INFO L475 AbstractCegarLoop]: Abstraction has 93287 states and 128837 transitions. [2019-10-02 13:51:09,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:51:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 93287 states and 128837 transitions. [2019-10-02 13:51:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:51:09,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:09,548 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:51:09,548 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash 923638419, now seen corresponding path program 1 times [2019-10-02 13:51:09,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:09,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:09,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:51:09,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:51:09,732 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 13:51:09,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:10,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:51:10,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:51:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:51:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:51:10,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:51:10,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:51:10,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:51:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:51:10,417 INFO L87 Difference]: Start difference. First operand 93287 states and 128837 transitions. Second operand 11 states. [2019-10-02 13:51:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:14,547 INFO L93 Difference]: Finished difference Result 192136 states and 262473 transitions. [2019-10-02 13:51:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:51:14,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2019-10-02 13:51:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:14,969 INFO L225 Difference]: With dead ends: 192136 [2019-10-02 13:51:14,969 INFO L226 Difference]: Without dead ends: 104229 [2019-10-02 13:51:15,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:51:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104229 states. [2019-10-02 13:51:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104229 to 102036. [2019-10-02 13:51:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102036 states. [2019-10-02 13:51:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102036 states to 102036 states and 137989 transitions. [2019-10-02 13:51:21,414 INFO L78 Accepts]: Start accepts. Automaton has 102036 states and 137989 transitions. Word has length 224 [2019-10-02 13:51:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:21,414 INFO L475 AbstractCegarLoop]: Abstraction has 102036 states and 137989 transitions. [2019-10-02 13:51:21,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:51:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 102036 states and 137989 transitions. [2019-10-02 13:51:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:51:21,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:21,511 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:21,511 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1416304384, now seen corresponding path program 1 times [2019-10-02 13:51:21,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:21,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:51:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:51:22,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:51:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:51:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:51:22,126 INFO L87 Difference]: Start difference. First operand 102036 states and 137989 transitions. Second operand 3 states. [2019-10-02 13:51:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:24,731 INFO L93 Difference]: Finished difference Result 207505 states and 283601 transitions. [2019-10-02 13:51:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:51:24,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:51:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:28,640 INFO L225 Difference]: With dead ends: 207505 [2019-10-02 13:51:28,641 INFO L226 Difference]: Without dead ends: 105780 [2019-10-02 13:51:28,816 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 13:51:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105780 states. [2019-10-02 13:51:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105780 to 105732. [2019-10-02 13:51:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105732 states. [2019-10-02 13:51:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105732 states to 105732 states and 145861 transitions. [2019-10-02 13:51:32,244 INFO L78 Accepts]: Start accepts. Automaton has 105732 states and 145861 transitions. Word has length 233 [2019-10-02 13:51:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:32,244 INFO L475 AbstractCegarLoop]: Abstraction has 105732 states and 145861 transitions. [2019-10-02 13:51:32,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:51:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 105732 states and 145861 transitions. [2019-10-02 13:51:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:51:32,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:32,324 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:32,324 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:32,324 INFO L82 PathProgramCache]: Analyzing trace with hash -935415775, now seen corresponding path program 1 times [2019-10-02 13:51:32,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:32,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:32,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:51:32,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:32,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:51:32,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:51:32,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:51:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:51:32,454 INFO L87 Difference]: Start difference. First operand 105732 states and 145861 transitions. Second operand 3 states. [2019-10-02 13:51:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:35,321 INFO L93 Difference]: Finished difference Result 218113 states and 306065 transitions. [2019-10-02 13:51:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:51:35,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:51:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:35,684 INFO L225 Difference]: With dead ends: 218113 [2019-10-02 13:51:35,685 INFO L226 Difference]: Without dead ends: 112692 [2019-10-02 13:51:35,853 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 13:51:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112692 states. [2019-10-02 13:51:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112692 to 112644. [2019-10-02 13:51:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112644 states. [2019-10-02 13:51:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112644 states to 112644 states and 160357 transitions. [2019-10-02 13:51:44,739 INFO L78 Accepts]: Start accepts. Automaton has 112644 states and 160357 transitions. Word has length 233 [2019-10-02 13:51:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:44,740 INFO L475 AbstractCegarLoop]: Abstraction has 112644 states and 160357 transitions. [2019-10-02 13:51:44,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:51:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 112644 states and 160357 transitions. [2019-10-02 13:51:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:51:44,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:44,869 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:44,869 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2050569400, now seen corresponding path program 1 times [2019-10-02 13:51:44,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:44,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:51:45,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:45,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:51:45,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:51:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:51:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:51:45,073 INFO L87 Difference]: Start difference. First operand 112644 states and 160357 transitions. Second operand 8 states. [2019-10-02 13:51:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:57,849 INFO L93 Difference]: Finished difference Result 343262 states and 511293 transitions. [2019-10-02 13:51:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:51:57,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2019-10-02 13:51:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:58,615 INFO L225 Difference]: With dead ends: 343262 [2019-10-02 13:51:58,616 INFO L226 Difference]: Without dead ends: 230929 [2019-10-02 13:51:58,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:51:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230929 states. [2019-10-02 13:52:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230929 to 189116. [2019-10-02 13:52:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189116 states. [2019-10-02 13:52:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189116 states to 189116 states and 285605 transitions. [2019-10-02 13:52:12,940 INFO L78 Accepts]: Start accepts. Automaton has 189116 states and 285605 transitions. Word has length 234 [2019-10-02 13:52:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:12,941 INFO L475 AbstractCegarLoop]: Abstraction has 189116 states and 285605 transitions. [2019-10-02 13:52:12,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:52:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 189116 states and 285605 transitions. [2019-10-02 13:52:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:52:13,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:13,259 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:13,260 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 827164752, now seen corresponding path program 1 times [2019-10-02 13:52:13,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:13,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:52:14,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:52:14,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:52:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:52:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:52:14,297 INFO L87 Difference]: Start difference. First operand 189116 states and 285605 transitions. Second operand 8 states. [2019-10-02 13:52:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:35,405 INFO L93 Difference]: Finished difference Result 578918 states and 919197 transitions. [2019-10-02 13:52:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:52:35,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-10-02 13:52:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:43,521 INFO L225 Difference]: With dead ends: 578918 [2019-10-02 13:52:43,522 INFO L226 Difference]: Without dead ends: 390113 [2019-10-02 13:52:43,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:52:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390113 states. [2019-10-02 13:53:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390113 to 325426. [2019-10-02 13:53:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325426 states. [2019-10-02 13:53:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325426 states to 325426 states and 525444 transitions. [2019-10-02 13:53:04,203 INFO L78 Accepts]: Start accepts. Automaton has 325426 states and 525444 transitions. Word has length 241 [2019-10-02 13:53:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:04,204 INFO L475 AbstractCegarLoop]: Abstraction has 325426 states and 525444 transitions. [2019-10-02 13:53:04,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:53:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 325426 states and 525444 transitions. [2019-10-02 13:53:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:53:04,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:04,896 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:53:04,896 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash -121299054, now seen corresponding path program 1 times [2019-10-02 13:53:04,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:04,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:04,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:04,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:53:05,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:05,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:05,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:05,027 INFO L87 Difference]: Start difference. First operand 325426 states and 525444 transitions. Second operand 3 states. [2019-10-02 13:53:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:31,175 INFO L93 Difference]: Finished difference Result 703637 states and 1194215 transitions. [2019-10-02 13:53:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:31,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-10-02 13:53:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:32,745 INFO L225 Difference]: With dead ends: 703637 [2019-10-02 13:53:32,745 INFO L226 Difference]: Without dead ends: 378522 [2019-10-02 13:53:33,295 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 13:53:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378522 states. [2019-10-02 13:54:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378522 to 349210. [2019-10-02 13:54:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349210 states. [2019-10-02 13:54:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349210 states to 349210 states and 629035 transitions. [2019-10-02 13:54:07,561 INFO L78 Accepts]: Start accepts. Automaton has 349210 states and 629035 transitions. Word has length 243 [2019-10-02 13:54:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:07,561 INFO L475 AbstractCegarLoop]: Abstraction has 349210 states and 629035 transitions. [2019-10-02 13:54:07,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 349210 states and 629035 transitions. [2019-10-02 13:54:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:54:10,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:10,598 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:10,598 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1098881872, now seen corresponding path program 1 times [2019-10-02 13:54:10,598 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:10,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:10,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:54:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:10,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:54:10,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:54:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:54:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:54:10,783 INFO L87 Difference]: Start difference. First operand 349210 states and 629035 transitions. Second operand 8 states. [2019-10-02 13:55:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:12,276 INFO L93 Difference]: Finished difference Result 1071200 states and 2078415 transitions. [2019-10-02 13:55:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:55:12,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-02 13:55:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:16,933 INFO L225 Difference]: With dead ends: 1071200 [2019-10-02 13:55:16,933 INFO L226 Difference]: Without dead ends: 722301 [2019-10-02 13:55:17,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:55:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722301 states. [2019-10-02 13:56:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722301 to 621012. [2019-10-02 13:56:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621012 states. [2019-10-02 13:56:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621012 states to 621012 states and 1234187 transitions. [2019-10-02 13:56:39,809 INFO L78 Accepts]: Start accepts. Automaton has 621012 states and 1234187 transitions. Word has length 242 [2019-10-02 13:56:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:39,809 INFO L475 AbstractCegarLoop]: Abstraction has 621012 states and 1234187 transitions. [2019-10-02 13:56:39,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:56:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 621012 states and 1234187 transitions.