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_spec4_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:26:05,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:26:05,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:26:05,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:26:05,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:26:05,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:26:05,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:26:05,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:26:05,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:26:05,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:26:05,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:26:05,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:26:05,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:26:05,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:26:05,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:26:05,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:26:05,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:26:05,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:26:05,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:26:05,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:26:05,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:26:05,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:26:05,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:26:05,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:26:05,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:26:05,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:26:05,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:26:05,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:26:05,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:26:05,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:26:05,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:26:05,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:26:05,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:26:05,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:26:05,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:26:05,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:26:05,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:26:05,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:26:05,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:26:05,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:26:05,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:26:05,369 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:26:05,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:26:05,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:26:05,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:26:05,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:26:05,400 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:26:05,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:26:05,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:26:05,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:26:05,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:26:05,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:26:05,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:26:05,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:26:05,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:26:05,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:26:05,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:26:05,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:26:05,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:26:05,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:26:05,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:26:05,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:26:05,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:26:05,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:26:05,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:26:05,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:26:05,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:26:05,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:26:05,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:26:05,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:26:05,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:26:05,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:26:05,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:26:05,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:26:05,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:26:05,472 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:26:05,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product23.cil.c [2019-10-02 13:26:05,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d76f570c/0b39ae2554004e13bbb4d2bff1bcda69/FLAGc8823576c [2019-10-02 13:26:06,264 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:26:06,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product23.cil.c [2019-10-02 13:26:06,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d76f570c/0b39ae2554004e13bbb4d2bff1bcda69/FLAGc8823576c [2019-10-02 13:26:06,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d76f570c/0b39ae2554004e13bbb4d2bff1bcda69 [2019-10-02 13:26:06,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:26:06,479 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:26:06,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:26:06,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:26:06,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:26:06,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:26:06" (1/1) ... [2019-10-02 13:26:06,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62afc45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:06, skipping insertion in model container [2019-10-02 13:26:06,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:26:06" (1/1) ... [2019-10-02 13:26:06,492 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:26:06,570 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:26:07,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:26:07,302 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:26:07,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:26:07,583 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:26:07,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07 WrapperNode [2019-10-02 13:26:07,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:26:07,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:26:07,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:26:07,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:26:07,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (1/1) ... [2019-10-02 13:26:07,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:26:07,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:26:07,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:26:07,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:26:07,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (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:26:07,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:26:07,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:26:07,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:26:07,911 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:26:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:26:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:26:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:26:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:26:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:26:07,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:26:07,913 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:26:07,913 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:26:07,913 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:26:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:26:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:26:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:26:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:26:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:26:07,915 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:26:07,915 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:26:07,915 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:26:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:26:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:26:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:26:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:26:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:26:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:26:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:26:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:26:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:26:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:26:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:26:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:26:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:26:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Keys [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:26:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:26:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:26:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:26:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:26:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:26:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:26:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:26:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:26:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:26:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:26:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:26:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:26:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:26:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:26:07,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:26:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:26:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:26:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:26:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:26:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:26:07,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:26:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:26:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:26:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:26:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:26:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:26:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:26:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:26:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:26:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:26:07,930 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:26:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:26:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:26:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:26:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:26:07,930 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:26:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:26:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:26:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:26:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:26:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:26:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:26:07,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:26:07,933 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:26:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:26:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:26:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:26:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:26:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:26:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:26:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:26:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:26:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:26:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:26:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:26:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:26:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:26:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:26:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:26:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:26:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:26:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:26:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:26:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:26:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:26:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:26:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:26:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:26:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Keys [2019-10-02 13:26:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:26:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:26:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:26:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:26:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:26:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:26:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:26:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:26:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:26:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:26:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:26:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:26:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:26:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:26:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:26:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:26:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:26:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:26:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:26:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:26:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:26:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:26:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:26:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:26:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:26:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:26:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:26:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:26:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:26:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:26:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:26:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:26:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:26:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:26:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:26:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:26:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:26:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:26:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:26:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:26:10,146 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:26:10,147 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:26:10,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:26:10 BoogieIcfgContainer [2019-10-02 13:26:10,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:26:10,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:26:10,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:26:10,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:26:10,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:26:06" (1/3) ... [2019-10-02 13:26:10,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19d21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:26:10, skipping insertion in model container [2019-10-02 13:26:10,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:26:07" (2/3) ... [2019-10-02 13:26:10,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19d21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:26:10, skipping insertion in model container [2019-10-02 13:26:10,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:26:10" (3/3) ... [2019-10-02 13:26:10,158 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product23.cil.c [2019-10-02 13:26:10,168 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:26:10,179 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:26:10,198 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:26:10,236 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:26:10,237 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:26:10,237 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:26:10,237 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:26:10,237 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:26:10,238 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:26:10,238 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:26:10,238 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:26:10,238 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:26:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states. [2019-10-02 13:26:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 13:26:10,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:10,319 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:10,322 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1052555921, now seen corresponding path program 1 times [2019-10-02 13:26:10,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:10,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:26:10,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:10,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:26:10,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:26:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:26:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:26:10,998 INFO L87 Difference]: Start difference. First operand 575 states. Second operand 2 states. [2019-10-02 13:26:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:11,083 INFO L93 Difference]: Finished difference Result 792 states and 1074 transitions. [2019-10-02 13:26:11,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:26:11,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 157 [2019-10-02 13:26:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:11,124 INFO L225 Difference]: With dead ends: 792 [2019-10-02 13:26:11,124 INFO L226 Difference]: Without dead ends: 524 [2019-10-02 13:26:11,138 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:26:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-10-02 13:26:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-10-02 13:26:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-10-02 13:26:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 716 transitions. [2019-10-02 13:26:11,300 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 716 transitions. Word has length 157 [2019-10-02 13:26:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:11,302 INFO L475 AbstractCegarLoop]: Abstraction has 524 states and 716 transitions. [2019-10-02 13:26:11,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:26:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 716 transitions. [2019-10-02 13:26:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 13:26:11,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:11,308 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:11,309 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1340998615, now seen corresponding path program 1 times [2019-10-02 13:26:11,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:11,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:11,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:11,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:26:11,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:11,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:11,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:11,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:11,498 INFO L87 Difference]: Start difference. First operand 524 states and 716 transitions. Second operand 3 states. [2019-10-02 13:26:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:11,543 INFO L93 Difference]: Finished difference Result 775 states and 1040 transitions. [2019-10-02 13:26:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:11,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 13:26:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:11,548 INFO L225 Difference]: With dead ends: 775 [2019-10-02 13:26:11,548 INFO L226 Difference]: Without dead ends: 527 [2019-10-02 13:26:11,550 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:26:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-02 13:26:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 526. [2019-10-02 13:26:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-02 13:26:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 718 transitions. [2019-10-02 13:26:11,577 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 718 transitions. Word has length 158 [2019-10-02 13:26:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:11,577 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 718 transitions. [2019-10-02 13:26:11,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 718 transitions. [2019-10-02 13:26:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 13:26:11,582 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:11,582 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:11,583 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 919719641, now seen corresponding path program 1 times [2019-10-02 13:26:11,583 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:26:11,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:11,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:11,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:11,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:11,815 INFO L87 Difference]: Start difference. First operand 526 states and 718 transitions. Second operand 3 states. [2019-10-02 13:26:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:11,862 INFO L93 Difference]: Finished difference Result 1030 states and 1437 transitions. [2019-10-02 13:26:11,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:11,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 13:26:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:11,871 INFO L225 Difference]: With dead ends: 1030 [2019-10-02 13:26:11,871 INFO L226 Difference]: Without dead ends: 569 [2019-10-02 13:26:11,874 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:26:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-02 13:26:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 568. [2019-10-02 13:26:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-02 13:26:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 790 transitions. [2019-10-02 13:26:11,917 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 790 transitions. Word has length 168 [2019-10-02 13:26:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:11,918 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 790 transitions. [2019-10-02 13:26:11,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 790 transitions. [2019-10-02 13:26:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 13:26:11,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:11,932 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:11,932 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1728319775, now seen corresponding path program 1 times [2019-10-02 13:26:11,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:11,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:11,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:11,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:26:12,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:12,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:12,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:12,204 INFO L87 Difference]: Start difference. First operand 568 states and 790 transitions. Second operand 3 states. [2019-10-02 13:26:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:12,246 INFO L93 Difference]: Finished difference Result 1153 states and 1648 transitions. [2019-10-02 13:26:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:12,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 13:26:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:12,252 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 13:26:12,253 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 13:26:12,255 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:26:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 13:26:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 649. [2019-10-02 13:26:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-02 13:26:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 928 transitions. [2019-10-02 13:26:12,286 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 928 transitions. Word has length 169 [2019-10-02 13:26:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:12,286 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 928 transitions. [2019-10-02 13:26:12,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 928 transitions. [2019-10-02 13:26:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 13:26:12,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:12,294 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:12,294 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1843291641, now seen corresponding path program 1 times [2019-10-02 13:26:12,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:12,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:12,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:26:12,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:12,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:12,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:12,477 INFO L87 Difference]: Start difference. First operand 649 states and 928 transitions. Second operand 3 states. [2019-10-02 13:26:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:12,514 INFO L93 Difference]: Finished difference Result 1390 states and 2052 transitions. [2019-10-02 13:26:12,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:12,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 13:26:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:12,520 INFO L225 Difference]: With dead ends: 1390 [2019-10-02 13:26:12,520 INFO L226 Difference]: Without dead ends: 806 [2019-10-02 13:26:12,523 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:26:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-10-02 13:26:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 805. [2019-10-02 13:26:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-10-02 13:26:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1192 transitions. [2019-10-02 13:26:12,556 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1192 transitions. Word has length 170 [2019-10-02 13:26:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:12,557 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 1192 transitions. [2019-10-02 13:26:12,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1192 transitions. [2019-10-02 13:26:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 13:26:12,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:12,562 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:12,562 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash 446108159, now seen corresponding path program 1 times [2019-10-02 13:26:12,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:12,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:26:12,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:12,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:12,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:12,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:12,742 INFO L87 Difference]: Start difference. First operand 805 states and 1192 transitions. Second operand 3 states. [2019-10-02 13:26:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:12,877 INFO L93 Difference]: Finished difference Result 1846 states and 2824 transitions. [2019-10-02 13:26:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:12,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 13:26:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:12,886 INFO L225 Difference]: With dead ends: 1846 [2019-10-02 13:26:12,887 INFO L226 Difference]: Without dead ends: 1106 [2019-10-02 13:26:12,891 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:26:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-10-02 13:26:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1105. [2019-10-02 13:26:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2019-10-02 13:26:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1696 transitions. [2019-10-02 13:26:12,944 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1696 transitions. Word has length 171 [2019-10-02 13:26:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:12,945 INFO L475 AbstractCegarLoop]: Abstraction has 1105 states and 1696 transitions. [2019-10-02 13:26:12,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1696 transitions. [2019-10-02 13:26:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 13:26:12,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:12,954 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:12,955 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2000282625, now seen corresponding path program 1 times [2019-10-02 13:26:12,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:12,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:26:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:26:13,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:26:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:26:13,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:26:13,186 INFO L87 Difference]: Start difference. First operand 1105 states and 1696 transitions. Second operand 7 states. [2019-10-02 13:26:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:16,322 INFO L93 Difference]: Finished difference Result 1593 states and 2336 transitions. [2019-10-02 13:26:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:26:16,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-10-02 13:26:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:16,333 INFO L225 Difference]: With dead ends: 1593 [2019-10-02 13:26:16,333 INFO L226 Difference]: Without dead ends: 1356 [2019-10-02 13:26:16,335 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 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:26:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-10-02 13:26:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1347. [2019-10-02 13:26:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-10-02 13:26:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2013 transitions. [2019-10-02 13:26:16,408 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2013 transitions. Word has length 174 [2019-10-02 13:26:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:16,409 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 2013 transitions. [2019-10-02 13:26:16,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:26:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2013 transitions. [2019-10-02 13:26:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 13:26:16,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:16,418 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:16,418 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1175251605, now seen corresponding path program 1 times [2019-10-02 13:26:16,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:16,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:16,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:16,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:16,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:26:16,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:16,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:26:16,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:26:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:26:16,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:26:16,792 INFO L87 Difference]: Start difference. First operand 1347 states and 2013 transitions. Second operand 18 states. [2019-10-02 13:26:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:17,314 INFO L93 Difference]: Finished difference Result 1920 states and 2781 transitions. [2019-10-02 13:26:17,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:26:17,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 175 [2019-10-02 13:26:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:17,325 INFO L225 Difference]: With dead ends: 1920 [2019-10-02 13:26:17,325 INFO L226 Difference]: Without dead ends: 1435 [2019-10-02 13:26:17,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:26:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2019-10-02 13:26:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1433. [2019-10-02 13:26:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-10-02 13:26:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2132 transitions. [2019-10-02 13:26:17,435 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2132 transitions. Word has length 175 [2019-10-02 13:26:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:17,436 INFO L475 AbstractCegarLoop]: Abstraction has 1433 states and 2132 transitions. [2019-10-02 13:26:17,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:26:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2132 transitions. [2019-10-02 13:26:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 13:26:17,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:17,445 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:17,446 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2007814747, now seen corresponding path program 1 times [2019-10-02 13:26:17,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:17,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:17,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:26:17,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:17,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:26:17,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:26:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:26:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:26:17,641 INFO L87 Difference]: Start difference. First operand 1433 states and 2132 transitions. Second operand 8 states. [2019-10-02 13:26:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:18,629 INFO L93 Difference]: Finished difference Result 2436 states and 3467 transitions. [2019-10-02 13:26:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:26:18,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-10-02 13:26:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:18,645 INFO L225 Difference]: With dead ends: 2436 [2019-10-02 13:26:18,645 INFO L226 Difference]: Without dead ends: 2043 [2019-10-02 13:26:18,648 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:26:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-10-02 13:26:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2024. [2019-10-02 13:26:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-10-02 13:26:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2922 transitions. [2019-10-02 13:26:18,760 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2922 transitions. Word has length 184 [2019-10-02 13:26:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:18,761 INFO L475 AbstractCegarLoop]: Abstraction has 2024 states and 2922 transitions. [2019-10-02 13:26:18,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:26:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2922 transitions. [2019-10-02 13:26:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 13:26:18,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:18,772 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:18,772 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -202279434, now seen corresponding path program 1 times [2019-10-02 13:26:18,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:18,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 13:26:19,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:19,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:26:19,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:26:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:26:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:26:19,138 INFO L87 Difference]: Start difference. First operand 2024 states and 2922 transitions. Second operand 17 states. [2019-10-02 13:26:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:19,978 INFO L93 Difference]: Finished difference Result 2579 states and 3658 transitions. [2019-10-02 13:26:19,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:26:19,979 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 185 [2019-10-02 13:26:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:19,994 INFO L225 Difference]: With dead ends: 2579 [2019-10-02 13:26:19,995 INFO L226 Difference]: Without dead ends: 2023 [2019-10-02 13:26:19,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:26:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-10-02 13:26:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2022. [2019-10-02 13:26:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-10-02 13:26:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2917 transitions. [2019-10-02 13:26:20,116 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2917 transitions. Word has length 185 [2019-10-02 13:26:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:20,120 INFO L475 AbstractCegarLoop]: Abstraction has 2022 states and 2917 transitions. [2019-10-02 13:26:20,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:26:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2917 transitions. [2019-10-02 13:26:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 13:26:20,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:20,138 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:20,138 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1555104262, now seen corresponding path program 2 times [2019-10-02 13:26:20,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:20,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 13:26:20,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:20,430 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:26:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:26:20,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 13:26:20,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:26:20,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:26:20,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:26:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:26:21,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-10-02 13:26:21,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:26:21,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:26:21,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:26:21,132 INFO L87 Difference]: Start difference. First operand 2022 states and 2917 transitions. Second operand 17 states. [2019-10-02 13:26:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:23,310 INFO L93 Difference]: Finished difference Result 4846 states and 6948 transitions. [2019-10-02 13:26:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:26:23,311 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 185 [2019-10-02 13:26:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:23,344 INFO L225 Difference]: With dead ends: 4846 [2019-10-02 13:26:23,345 INFO L226 Difference]: Without dead ends: 3850 [2019-10-02 13:26:23,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:26:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2019-10-02 13:26:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3825. [2019-10-02 13:26:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-10-02 13:26:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5594 transitions. [2019-10-02 13:26:23,560 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5594 transitions. Word has length 185 [2019-10-02 13:26:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:23,560 INFO L475 AbstractCegarLoop]: Abstraction has 3825 states and 5594 transitions. [2019-10-02 13:26:23,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:26:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5594 transitions. [2019-10-02 13:26:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 13:26:23,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:23,583 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:23,584 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -678556981, now seen corresponding path program 1 times [2019-10-02 13:26:23,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:23,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:23,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:26:23,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:26:23,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:23,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:26:23,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:26:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:26:23,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:26:23,847 INFO L87 Difference]: Start difference. First operand 3825 states and 5594 transitions. Second operand 8 states. [2019-10-02 13:26:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:23,976 INFO L93 Difference]: Finished difference Result 5870 states and 8332 transitions. [2019-10-02 13:26:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:26:23,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 291 [2019-10-02 13:26:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:24,003 INFO L225 Difference]: With dead ends: 5870 [2019-10-02 13:26:24,003 INFO L226 Difference]: Without dead ends: 3825 [2019-10-02 13:26:24,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:26:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-10-02 13:26:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 3825. [2019-10-02 13:26:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3825 states. [2019-10-02 13:26:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5586 transitions. [2019-10-02 13:26:24,265 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5586 transitions. Word has length 291 [2019-10-02 13:26:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:24,266 INFO L475 AbstractCegarLoop]: Abstraction has 3825 states and 5586 transitions. [2019-10-02 13:26:24,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:26:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5586 transitions. [2019-10-02 13:26:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:26:24,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:24,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:24,291 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 225257160, now seen corresponding path program 1 times [2019-10-02 13:26:24,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:24,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:24,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 13:26:24,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:24,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:26:24,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:26:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:26:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:26:24,699 INFO L87 Difference]: Start difference. First operand 3825 states and 5586 transitions. Second operand 13 states. [2019-10-02 13:26:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:28,168 INFO L93 Difference]: Finished difference Result 9729 states and 14045 transitions. [2019-10-02 13:26:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:26:28,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 298 [2019-10-02 13:26:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:28,228 INFO L225 Difference]: With dead ends: 9729 [2019-10-02 13:26:28,229 INFO L226 Difference]: Without dead ends: 7684 [2019-10-02 13:26:28,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:26:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2019-10-02 13:26:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7641. [2019-10-02 13:26:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-10-02 13:26:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 11169 transitions. [2019-10-02 13:26:28,599 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 11169 transitions. Word has length 298 [2019-10-02 13:26:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:28,600 INFO L475 AbstractCegarLoop]: Abstraction has 7641 states and 11169 transitions. [2019-10-02 13:26:28,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:26:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 11169 transitions. [2019-10-02 13:26:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:26:28,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:28,640 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:28,640 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1525918494, now seen corresponding path program 1 times [2019-10-02 13:26:28,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:28,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 13:26:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:28,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:28,872 INFO L87 Difference]: Start difference. First operand 7641 states and 11169 transitions. Second operand 3 states. [2019-10-02 13:26:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:29,248 INFO L93 Difference]: Finished difference Result 17516 states and 26257 transitions. [2019-10-02 13:26:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:29,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-10-02 13:26:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:29,312 INFO L225 Difference]: With dead ends: 17516 [2019-10-02 13:26:29,312 INFO L226 Difference]: Without dead ends: 9949 [2019-10-02 13:26:29,343 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:26:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9949 states. [2019-10-02 13:26:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9949 to 9945. [2019-10-02 13:26:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9945 states. [2019-10-02 13:26:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9945 states to 9945 states and 15105 transitions. [2019-10-02 13:26:29,888 INFO L78 Accepts]: Start accepts. Automaton has 9945 states and 15105 transitions. Word has length 296 [2019-10-02 13:26:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:29,888 INFO L475 AbstractCegarLoop]: Abstraction has 9945 states and 15105 transitions. [2019-10-02 13:26:29,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 9945 states and 15105 transitions. [2019-10-02 13:26:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:26:29,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:29,955 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:29,955 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1747701484, now seen corresponding path program 1 times [2019-10-02 13:26:29,956 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:29,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:29,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:29,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 13:26:30,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:30,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:26:30,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:26:30,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:26:30,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:26:30,258 INFO L87 Difference]: Start difference. First operand 9945 states and 15105 transitions. Second operand 11 states. [2019-10-02 13:26:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:35,301 INFO L93 Difference]: Finished difference Result 16356 states and 23483 transitions. [2019-10-02 13:26:35,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:26:35,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-10-02 13:26:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:35,356 INFO L225 Difference]: With dead ends: 16356 [2019-10-02 13:26:35,356 INFO L226 Difference]: Without dead ends: 12381 [2019-10-02 13:26:35,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:26:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12381 states. [2019-10-02 13:26:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12381 to 12189. [2019-10-02 13:26:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12189 states. [2019-10-02 13:26:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12189 states to 12189 states and 18053 transitions. [2019-10-02 13:26:35,926 INFO L78 Accepts]: Start accepts. Automaton has 12189 states and 18053 transitions. Word has length 298 [2019-10-02 13:26:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:35,927 INFO L475 AbstractCegarLoop]: Abstraction has 12189 states and 18053 transitions. [2019-10-02 13:26:35,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:26:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 12189 states and 18053 transitions. [2019-10-02 13:26:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-02 13:26:35,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:35,980 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:35,980 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 949240528, now seen corresponding path program 1 times [2019-10-02 13:26:35,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:35,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:35,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 13:26:36,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:36,961 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:26:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:37,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 3377 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:26:37,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:26:37,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:26:37,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [37] total 44 [2019-10-02 13:26:37,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 13:26:37,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 13:26:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 13:26:37,993 INFO L87 Difference]: Start difference. First operand 12189 states and 18053 transitions. Second operand 44 states. [2019-10-02 13:26:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:46,406 INFO L93 Difference]: Finished difference Result 24434 states and 36146 transitions. [2019-10-02 13:26:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 13:26:46,406 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 316 [2019-10-02 13:26:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:46,452 INFO L225 Difference]: With dead ends: 24434 [2019-10-02 13:26:46,452 INFO L226 Difference]: Without dead ends: 11797 [2019-10-02 13:26:46,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=420, Invalid=8322, Unknown=0, NotChecked=0, Total=8742 [2019-10-02 13:26:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11797 states. [2019-10-02 13:26:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11797 to 11771. [2019-10-02 13:26:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11771 states. [2019-10-02 13:26:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 17374 transitions. [2019-10-02 13:26:47,039 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 17374 transitions. Word has length 316 [2019-10-02 13:26:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:47,040 INFO L475 AbstractCegarLoop]: Abstraction has 11771 states and 17374 transitions. [2019-10-02 13:26:47,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 13:26:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 17374 transitions. [2019-10-02 13:26:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 13:26:47,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:47,067 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:47,067 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1475381118, now seen corresponding path program 1 times [2019-10-02 13:26:47,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:47,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:47,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:47,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 13:26:47,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:47,334 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:26:47,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:47,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 3420 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:26:47,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 13:26:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:26:48,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 13:26:48,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:26:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:26:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:26:48,169 INFO L87 Difference]: Start difference. First operand 11771 states and 17374 transitions. Second operand 12 states. [2019-10-02 13:26:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:51,955 INFO L93 Difference]: Finished difference Result 26403 states and 39655 transitions. [2019-10-02 13:26:51,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 13:26:51,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 326 [2019-10-02 13:26:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:52,015 INFO L225 Difference]: With dead ends: 26403 [2019-10-02 13:26:52,016 INFO L226 Difference]: Without dead ends: 14651 [2019-10-02 13:26:52,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-10-02 13:26:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14651 states. [2019-10-02 13:26:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14651 to 14592. [2019-10-02 13:26:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14592 states. [2019-10-02 13:26:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14592 states to 14592 states and 22092 transitions. [2019-10-02 13:26:53,497 INFO L78 Accepts]: Start accepts. Automaton has 14592 states and 22092 transitions. Word has length 326 [2019-10-02 13:26:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:53,498 INFO L475 AbstractCegarLoop]: Abstraction has 14592 states and 22092 transitions. [2019-10-02 13:26:53,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:26:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14592 states and 22092 transitions. [2019-10-02 13:26:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 13:26:53,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:53,546 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:53,546 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -224566306, now seen corresponding path program 1 times [2019-10-02 13:26:53,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:53,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:53,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:53,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:26:53,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:53,865 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:26:54,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:54,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 3422 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:26:54,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 13:26:54,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:26:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:26:54,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:26:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:26:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:26:54,733 INFO L87 Difference]: Start difference. First operand 14592 states and 22092 transitions. Second operand 25 states. [2019-10-02 13:27:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:00,502 INFO L93 Difference]: Finished difference Result 31099 states and 46753 transitions. [2019-10-02 13:27:00,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 13:27:00,503 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 328 [2019-10-02 13:27:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:00,574 INFO L225 Difference]: With dead ends: 31099 [2019-10-02 13:27:00,574 INFO L226 Difference]: Without dead ends: 16169 [2019-10-02 13:27:00,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=2834, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:27:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16169 states. [2019-10-02 13:27:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16169 to 16070. [2019-10-02 13:27:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16070 states. [2019-10-02 13:27:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16070 states to 16070 states and 24063 transitions. [2019-10-02 13:27:01,285 INFO L78 Accepts]: Start accepts. Automaton has 16070 states and 24063 transitions. Word has length 328 [2019-10-02 13:27:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:01,286 INFO L475 AbstractCegarLoop]: Abstraction has 16070 states and 24063 transitions. [2019-10-02 13:27:01,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:27:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 16070 states and 24063 transitions. [2019-10-02 13:27:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-02 13:27:01,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:01,320 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:01,321 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1964193505, now seen corresponding path program 1 times [2019-10-02 13:27:01,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:01,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 13:27:01,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:01,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:27:01,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:27:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:27:01,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:27:01,546 INFO L87 Difference]: Start difference. First operand 16070 states and 24063 transitions. Second operand 8 states. [2019-10-02 13:27:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:07,862 INFO L93 Difference]: Finished difference Result 41899 states and 61350 transitions. [2019-10-02 13:27:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:27:07,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2019-10-02 13:27:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:08,017 INFO L225 Difference]: With dead ends: 41899 [2019-10-02 13:27:08,017 INFO L226 Difference]: Without dead ends: 37150 [2019-10-02 13:27:08,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:27:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37150 states. [2019-10-02 13:27:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37150 to 36856. [2019-10-02 13:27:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36856 states. [2019-10-02 13:27:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36856 states to 36856 states and 54611 transitions. [2019-10-02 13:27:09,502 INFO L78 Accepts]: Start accepts. Automaton has 36856 states and 54611 transitions. Word has length 330 [2019-10-02 13:27:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:09,502 INFO L475 AbstractCegarLoop]: Abstraction has 36856 states and 54611 transitions. [2019-10-02 13:27:09,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:27:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36856 states and 54611 transitions. [2019-10-02 13:27:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-10-02 13:27:09,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:09,584 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:09,585 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1806942403, now seen corresponding path program 1 times [2019-10-02 13:27:09,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-10-02 13:27:09,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:09,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:27:09,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:27:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:27:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:27:09,855 INFO L87 Difference]: Start difference. First operand 36856 states and 54611 transitions. Second operand 6 states. [2019-10-02 13:27:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:11,484 INFO L93 Difference]: Finished difference Result 58485 states and 86022 transitions. [2019-10-02 13:27:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:27:11,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 461 [2019-10-02 13:27:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:11,585 INFO L225 Difference]: With dead ends: 58485 [2019-10-02 13:27:11,585 INFO L226 Difference]: Without dead ends: 21778 [2019-10-02 13:27:11,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:27:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21778 states. [2019-10-02 13:27:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21778 to 21771. [2019-10-02 13:27:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21771 states. [2019-10-02 13:27:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21771 states to 21771 states and 31432 transitions. [2019-10-02 13:27:12,511 INFO L78 Accepts]: Start accepts. Automaton has 21771 states and 31432 transitions. Word has length 461 [2019-10-02 13:27:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:12,511 INFO L475 AbstractCegarLoop]: Abstraction has 21771 states and 31432 transitions. [2019-10-02 13:27:12,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:27:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21771 states and 31432 transitions. [2019-10-02 13:27:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 13:27:12,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:12,553 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:12,553 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 940963252, now seen corresponding path program 1 times [2019-10-02 13:27:12,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:12,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:12,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:12,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 13:27:12,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:12,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:27:12,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:27:12,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:27:12,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:27:12,783 INFO L87 Difference]: Start difference. First operand 21771 states and 31432 transitions. Second operand 8 states. [2019-10-02 13:27:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:18,981 INFO L93 Difference]: Finished difference Result 37514 states and 52828 transitions. [2019-10-02 13:27:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:27:18,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 331 [2019-10-02 13:27:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:19,096 INFO L225 Difference]: With dead ends: 37514 [2019-10-02 13:27:19,096 INFO L226 Difference]: Without dead ends: 29483 [2019-10-02 13:27:19,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:27:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29483 states. [2019-10-02 13:27:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29483 to 29241. [2019-10-02 13:27:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29241 states. [2019-10-02 13:27:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29241 states to 29241 states and 41987 transitions. [2019-10-02 13:27:21,354 INFO L78 Accepts]: Start accepts. Automaton has 29241 states and 41987 transitions. Word has length 331 [2019-10-02 13:27:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:21,354 INFO L475 AbstractCegarLoop]: Abstraction has 29241 states and 41987 transitions. [2019-10-02 13:27:21,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:27:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29241 states and 41987 transitions. [2019-10-02 13:27:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 13:27:21,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:21,410 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:21,410 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:21,411 INFO L82 PathProgramCache]: Analyzing trace with hash -962496843, now seen corresponding path program 1 times [2019-10-02 13:27:21,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:21,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:21,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 13:27:21,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:27:21,749 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:27:21,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:22,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 3424 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:27:22,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:27:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 13:27:22,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:27:22,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:27:22,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:27:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:27:22,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:27:22,630 INFO L87 Difference]: Start difference. First operand 29241 states and 41987 transitions. Second operand 25 states. [2019-10-02 13:27:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:29,253 INFO L93 Difference]: Finished difference Result 60241 states and 86206 transitions. [2019-10-02 13:27:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 13:27:29,254 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 331 [2019-10-02 13:27:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:29,378 INFO L225 Difference]: With dead ends: 60241 [2019-10-02 13:27:29,379 INFO L226 Difference]: Without dead ends: 30848 [2019-10-02 13:27:29,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=2831, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:27:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30848 states. [2019-10-02 13:27:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30848 to 30505. [2019-10-02 13:27:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30505 states. [2019-10-02 13:27:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30505 states to 30505 states and 43569 transitions. [2019-10-02 13:27:31,157 INFO L78 Accepts]: Start accepts. Automaton has 30505 states and 43569 transitions. Word has length 331 [2019-10-02 13:27:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 30505 states and 43569 transitions. [2019-10-02 13:27:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:27:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 30505 states and 43569 transitions. [2019-10-02 13:27:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 13:27:31,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:31,215 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:31,215 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash 220993609, now seen corresponding path program 1 times [2019-10-02 13:27:31,215 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:31,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 13:27:31,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:27:31,563 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:27:31,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:32,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:27:32,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:27:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 13:27:32,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:27:32,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 13:27:32,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 13:27:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 13:27:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:27:32,699 INFO L87 Difference]: Start difference. First operand 30505 states and 43569 transitions. Second operand 23 states. [2019-10-02 13:27:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:36,517 INFO L93 Difference]: Finished difference Result 43778 states and 61952 transitions. [2019-10-02 13:27:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 13:27:36,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 333 [2019-10-02 13:27:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:36,554 INFO L225 Difference]: With dead ends: 43778 [2019-10-02 13:27:36,555 INFO L226 Difference]: Without dead ends: 15474 [2019-10-02 13:27:36,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=2423, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:27:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15474 states. [2019-10-02 13:27:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15474 to 15258. [2019-10-02 13:27:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15258 states. [2019-10-02 13:27:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15258 states to 15258 states and 22211 transitions. [2019-10-02 13:27:37,257 INFO L78 Accepts]: Start accepts. Automaton has 15258 states and 22211 transitions. Word has length 333 [2019-10-02 13:27:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:37,258 INFO L475 AbstractCegarLoop]: Abstraction has 15258 states and 22211 transitions. [2019-10-02 13:27:37,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 13:27:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15258 states and 22211 transitions. [2019-10-02 13:27:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 13:27:37,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:37,289 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:37,289 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash 169639555, now seen corresponding path program 1 times [2019-10-02 13:27:37,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 13:27:38,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:27:38,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:27:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:39,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 3426 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:27:39,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:27:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 13:27:39,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:27:39,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-10-02 13:27:39,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:27:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:27:39,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:27:39,471 INFO L87 Difference]: Start difference. First operand 15258 states and 22211 transitions. Second operand 17 states. [2019-10-02 13:27:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:43,417 INFO L93 Difference]: Finished difference Result 30462 states and 44536 transitions. [2019-10-02 13:27:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 13:27:43,417 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 334 [2019-10-02 13:27:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:43,457 INFO L225 Difference]: With dead ends: 30462 [2019-10-02 13:27:43,458 INFO L226 Difference]: Without dead ends: 15326 [2019-10-02 13:27:43,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:27:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-10-02 13:27:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15280. [2019-10-02 13:27:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15280 states. [2019-10-02 13:27:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15280 states to 15280 states and 22204 transitions. [2019-10-02 13:27:44,021 INFO L78 Accepts]: Start accepts. Automaton has 15280 states and 22204 transitions. Word has length 334 [2019-10-02 13:27:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:44,021 INFO L475 AbstractCegarLoop]: Abstraction has 15280 states and 22204 transitions. [2019-10-02 13:27:44,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:27:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15280 states and 22204 transitions. [2019-10-02 13:27:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-10-02 13:27:44,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:44,054 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:44,054 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 760010006, now seen corresponding path program 1 times [2019-10-02 13:27:44,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:44,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-10-02 13:27:44,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:27:44,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:27:44,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:45,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 3916 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:27:45,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:27:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-02 13:27:45,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:27:45,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-02 13:27:45,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:27:45,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:27:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:27:45,468 INFO L87 Difference]: Start difference. First operand 15280 states and 22204 transitions. Second operand 9 states. [2019-10-02 13:27:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:48,167 INFO L93 Difference]: Finished difference Result 46289 states and 65053 transitions. [2019-10-02 13:27:48,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:27:48,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 445 [2019-10-02 13:27:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:48,265 INFO L225 Difference]: With dead ends: 46289 [2019-10-02 13:27:48,265 INFO L226 Difference]: Without dead ends: 38425 [2019-10-02 13:27:48,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:27:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38425 states. [2019-10-02 13:27:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38425 to 37299. [2019-10-02 13:27:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37299 states. [2019-10-02 13:27:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37299 states to 37299 states and 53300 transitions. [2019-10-02 13:27:49,984 INFO L78 Accepts]: Start accepts. Automaton has 37299 states and 53300 transitions. Word has length 445 [2019-10-02 13:27:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:49,985 INFO L475 AbstractCegarLoop]: Abstraction has 37299 states and 53300 transitions. [2019-10-02 13:27:49,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:27:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 37299 states and 53300 transitions. [2019-10-02 13:27:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-10-02 13:27:50,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:50,057 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:50,057 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1132705138, now seen corresponding path program 1 times [2019-10-02 13:27:50,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:50,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:50,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-10-02 13:27:50,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:27:50,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:27:50,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:51,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 3970 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:27:51,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:27:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-02 13:27:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:27:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 13:27:51,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:27:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:27:51,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:27:51,343 INFO L87 Difference]: Start difference. First operand 37299 states and 53300 transitions. Second operand 14 states. [2019-10-02 13:27:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:53,445 INFO L93 Difference]: Finished difference Result 59499 states and 82290 transitions. [2019-10-02 13:27:53,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:27:53,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 461 [2019-10-02 13:27:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:53,538 INFO L225 Difference]: With dead ends: 59499 [2019-10-02 13:27:53,538 INFO L226 Difference]: Without dead ends: 28410 [2019-10-02 13:27:53,590 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:27:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28410 states. [2019-10-02 13:27:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28410 to 27881. [2019-10-02 13:27:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27881 states. [2019-10-02 13:27:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27881 states to 27881 states and 41193 transitions. [2019-10-02 13:27:55,018 INFO L78 Accepts]: Start accepts. Automaton has 27881 states and 41193 transitions. Word has length 461 [2019-10-02 13:27:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:55,019 INFO L475 AbstractCegarLoop]: Abstraction has 27881 states and 41193 transitions. [2019-10-02 13:27:55,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:27:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27881 states and 41193 transitions. [2019-10-02 13:27:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-10-02 13:27:55,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:55,080 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:55,080 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1402302504, now seen corresponding path program 1 times [2019-10-02 13:27:55,081 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:55,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:55,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:55,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 13:27:55,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:55,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:55,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:55,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:55,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:55,289 INFO L87 Difference]: Start difference. First operand 27881 states and 41193 transitions. Second operand 3 states. [2019-10-02 13:27:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:56,804 INFO L93 Difference]: Finished difference Result 66168 states and 99950 transitions. [2019-10-02 13:27:56,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:56,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-10-02 13:27:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:56,899 INFO L225 Difference]: With dead ends: 66168 [2019-10-02 13:27:56,899 INFO L226 Difference]: Without dead ends: 38933 [2019-10-02 13:27:56,942 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:27:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38933 states. [2019-10-02 13:27:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38933 to 38921. [2019-10-02 13:27:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38921 states. [2019-10-02 13:27:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38921 states to 38921 states and 59332 transitions. [2019-10-02 13:27:58,541 INFO L78 Accepts]: Start accepts. Automaton has 38921 states and 59332 transitions. Word has length 402 [2019-10-02 13:27:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:58,542 INFO L475 AbstractCegarLoop]: Abstraction has 38921 states and 59332 transitions. [2019-10-02 13:27:58,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38921 states and 59332 transitions. [2019-10-02 13:27:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-02 13:27:58,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:58,652 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:58,652 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash -658908175, now seen corresponding path program 1 times [2019-10-02 13:27:58,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:58,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:58,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:27:58,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:58,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:58,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:58,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:58,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:58,824 INFO L87 Difference]: Start difference. First operand 38921 states and 59332 transitions. Second operand 3 states. [2019-10-02 13:28:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:01,113 INFO L93 Difference]: Finished difference Result 99583 states and 154859 transitions. [2019-10-02 13:28:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:01,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-10-02 13:28:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:01,294 INFO L225 Difference]: With dead ends: 99583 [2019-10-02 13:28:01,294 INFO L226 Difference]: Without dead ends: 61242 [2019-10-02 13:28:01,372 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:28:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61242 states. [2019-10-02 13:28:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61242 to 61230. [2019-10-02 13:28:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61230 states. [2019-10-02 13:28:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61230 states to 61230 states and 95651 transitions. [2019-10-02 13:28:05,834 INFO L78 Accepts]: Start accepts. Automaton has 61230 states and 95651 transitions. Word has length 344 [2019-10-02 13:28:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:05,835 INFO L475 AbstractCegarLoop]: Abstraction has 61230 states and 95651 transitions. [2019-10-02 13:28:05,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 61230 states and 95651 transitions. [2019-10-02 13:28:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 13:28:06,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:06,036 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:28:06,036 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1932379109, now seen corresponding path program 1 times [2019-10-02 13:28:06,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:06,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:28:06,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:06,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:28:06,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:28:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:28:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:28:06,504 INFO L87 Difference]: Start difference. First operand 61230 states and 95651 transitions. Second operand 3 states. [2019-10-02 13:28:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:11,718 INFO L93 Difference]: Finished difference Result 162833 states and 257361 transitions. [2019-10-02 13:28:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:11,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-10-02 13:28:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:12,004 INFO L225 Difference]: With dead ends: 162833 [2019-10-02 13:28:12,004 INFO L226 Difference]: Without dead ends: 102575 [2019-10-02 13:28:12,121 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:28:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102575 states. [2019-10-02 13:28:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102575 to 102563. [2019-10-02 13:28:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102563 states. [2019-10-02 13:28:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102563 states to 102563 states and 161789 transitions. [2019-10-02 13:28:17,318 INFO L78 Accepts]: Start accepts. Automaton has 102563 states and 161789 transitions. Word has length 345 [2019-10-02 13:28:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:17,318 INFO L475 AbstractCegarLoop]: Abstraction has 102563 states and 161789 transitions. [2019-10-02 13:28:17,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 102563 states and 161789 transitions. [2019-10-02 13:28:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-02 13:28:17,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:17,788 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:28:17,788 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1316594641, now seen corresponding path program 1 times [2019-10-02 13:28:17,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:17,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:17,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:17,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:28:20,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:20,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:28:20,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:28:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:28:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:28:20,218 INFO L87 Difference]: Start difference. First operand 102563 states and 161789 transitions. Second operand 3 states. [2019-10-02 13:28:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:27,387 INFO L93 Difference]: Finished difference Result 282711 states and 449614 transitions. [2019-10-02 13:28:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:28:27,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-10-02 13:28:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:27,848 INFO L225 Difference]: With dead ends: 282711 [2019-10-02 13:28:27,849 INFO L226 Difference]: Without dead ends: 181272 [2019-10-02 13:28:27,999 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:28:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181272 states. [2019-10-02 13:28:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181272 to 181260. [2019-10-02 13:28:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181260 states. [2019-10-02 13:28:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181260 states to 181260 states and 286837 transitions. [2019-10-02 13:28:44,231 INFO L78 Accepts]: Start accepts. Automaton has 181260 states and 286837 transitions. Word has length 346 [2019-10-02 13:28:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:44,232 INFO L475 AbstractCegarLoop]: Abstraction has 181260 states and 286837 transitions. [2019-10-02 13:28:44,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 181260 states and 286837 transitions. [2019-10-02 13:28:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-02 13:28:45,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:45,208 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:28:45,208 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash 781032133, now seen corresponding path program 1 times [2019-10-02 13:28:45,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:45,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:45,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:28:45,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:45,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:28:45,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:28:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:28:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:28:45,339 INFO L87 Difference]: Start difference. First operand 181260 states and 286837 transitions. Second operand 3 states. [2019-10-02 13:29:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:29:03,741 INFO L93 Difference]: Finished difference Result 510818 states and 808963 transitions. [2019-10-02 13:29:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:29:03,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-10-02 13:29:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:29:04,802 INFO L225 Difference]: With dead ends: 510818 [2019-10-02 13:29:04,802 INFO L226 Difference]: Without dead ends: 330882 [2019-10-02 13:29:05,128 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:29:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330882 states. [2019-10-02 13:29:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330882 to 330870. [2019-10-02 13:29:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330870 states. [2019-10-02 13:29:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330870 states to 330870 states and 518888 transitions. [2019-10-02 13:29:32,403 INFO L78 Accepts]: Start accepts. Automaton has 330870 states and 518888 transitions. Word has length 347 [2019-10-02 13:29:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:29:32,403 INFO L475 AbstractCegarLoop]: Abstraction has 330870 states and 518888 transitions. [2019-10-02 13:29:32,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:29:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 330870 states and 518888 transitions. [2019-10-02 13:29:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-02 13:29:33,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:29:33,952 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:29:33,953 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:29:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:29:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1860132636, now seen corresponding path program 1 times [2019-10-02 13:29:33,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:29:33,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:29:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:33,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:29:33,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:29:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:29:34,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:29:34,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:29:34,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:29:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:29:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:29:34,193 INFO L87 Difference]: Start difference. First operand 330870 states and 518888 transitions. Second operand 7 states. [2019-10-02 13:30:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:04,465 INFO L93 Difference]: Finished difference Result 660561 states and 1043828 transitions. [2019-10-02 13:30:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:30:04,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 403 [2019-10-02 13:30:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:05,406 INFO L225 Difference]: With dead ends: 660561 [2019-10-02 13:30:05,406 INFO L226 Difference]: Without dead ends: 331014 [2019-10-02 13:30:05,951 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:30:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331014 states. [2019-10-02 13:30:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331014 to 331014. [2019-10-02 13:30:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331014 states. [2019-10-02 13:30:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331014 states to 331014 states and 519064 transitions. [2019-10-02 13:30:36,017 INFO L78 Accepts]: Start accepts. Automaton has 331014 states and 519064 transitions. Word has length 403 [2019-10-02 13:30:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:36,018 INFO L475 AbstractCegarLoop]: Abstraction has 331014 states and 519064 transitions. [2019-10-02 13:30:36,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:30:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 331014 states and 519064 transitions. [2019-10-02 13:30:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-02 13:30:37,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:37,531 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:37,531 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1535038129, now seen corresponding path program 1 times [2019-10-02 13:30:37,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:37,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:37,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:30:37,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:37,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:30:37,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:30:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:30:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:30:37,675 INFO L87 Difference]: Start difference. First operand 331014 states and 519064 transitions. Second operand 3 states. [2019-10-02 13:31:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:14,243 INFO L93 Difference]: Finished difference Result 614077 states and 964119 transitions. [2019-10-02 13:31:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:31:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-10-02 13:31:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:16,310 INFO L225 Difference]: With dead ends: 614077 [2019-10-02 13:31:16,310 INFO L226 Difference]: Without dead ends: 601836 [2019-10-02 13:31:16,521 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:31:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601836 states. [2019-10-02 13:32:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601836 to 598752. [2019-10-02 13:32:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598752 states. [2019-10-02 13:32:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598752 states to 598752 states and 938344 transitions. [2019-10-02 13:32:12,523 INFO L78 Accepts]: Start accepts. Automaton has 598752 states and 938344 transitions. Word has length 348 [2019-10-02 13:32:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:32:12,523 INFO L475 AbstractCegarLoop]: Abstraction has 598752 states and 938344 transitions. [2019-10-02 13:32:12,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:32:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 598752 states and 938344 transitions. [2019-10-02 13:32:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-10-02 13:32:25,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:32:25,666 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:32:25,666 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:32:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:32:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash -641988572, now seen corresponding path program 1 times [2019-10-02 13:32:25,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:32:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:32:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:32:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:32:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:32:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:32:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 13:32:25,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:32:25,912 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:32:26,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:32:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:32:26,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 3835 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 13:32:26,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:32:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:32:27,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:32:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-02 13:32:27,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:32:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:32:27,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:32:27,834 INFO L87 Difference]: Start difference. First operand 598752 states and 938344 transitions. Second operand 17 states. [2019-10-02 13:33:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:33:07,975 INFO L93 Difference]: Finished difference Result 623877 states and 973012 transitions. [2019-10-02 13:33:07,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:33:07,975 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 404 [2019-10-02 13:33:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:33:10,745 INFO L225 Difference]: With dead ends: 623877 [2019-10-02 13:33:10,745 INFO L226 Difference]: Without dead ends: 611636 [2019-10-02 13:33:10,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:33:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611636 states. [2019-10-02 13:34:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611636 to 608570. [2019-10-02 13:34:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608570 states. [2019-10-02 13:34:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608570 states to 608570 states and 952851 transitions. [2019-10-02 13:34:04,052 INFO L78 Accepts]: Start accepts. Automaton has 608570 states and 952851 transitions. Word has length 404 [2019-10-02 13:34:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:34:04,053 INFO L475 AbstractCegarLoop]: Abstraction has 608570 states and 952851 transitions. [2019-10-02 13:34:04,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:34:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 608570 states and 952851 transitions. [2019-10-02 13:34:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-02 13:34:22,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:34:22,103 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:34:22,104 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:34:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:34:22,104 INFO L82 PathProgramCache]: Analyzing trace with hash -412900955, now seen corresponding path program 1 times [2019-10-02 13:34:22,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:34:22,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:34:22,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:34:22,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:34:22,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:34:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:34:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 13:34:22,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:34:22,329 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:34:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:34:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:34:23,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 3474 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:34:23,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:34:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 13:34:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:34:23,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-10-02 13:34:23,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:34:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:34:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:34:23,191 INFO L87 Difference]: Start difference. First operand 608570 states and 952851 transitions. Second operand 18 states. [2019-10-02 13:34:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:34:58,509 INFO L93 Difference]: Finished difference Result 619753 states and 967549 transitions. [2019-10-02 13:34:58,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:34:58,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 349 [2019-10-02 13:34:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:35:00,438 INFO L225 Difference]: With dead ends: 619753 [2019-10-02 13:35:00,438 INFO L226 Difference]: Without dead ends: 609098 [2019-10-02 13:35:00,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:35:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609098 states. [2019-10-02 13:36:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609098 to 608714. [2019-10-02 13:36:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608714 states. [2019-10-02 13:36:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608714 states to 608714 states and 952995 transitions. [2019-10-02 13:36:04,718 INFO L78 Accepts]: Start accepts. Automaton has 608714 states and 952995 transitions. Word has length 349 [2019-10-02 13:36:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:36:04,719 INFO L475 AbstractCegarLoop]: Abstraction has 608714 states and 952995 transitions. [2019-10-02 13:36:04,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:36:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 608714 states and 952995 transitions. [2019-10-02 13:36:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 13:36:09,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:36:09,511 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:36:09,511 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:36:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:36:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1324077075, now seen corresponding path program 1 times [2019-10-02 13:36:09,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:36:09,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:36:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:36:09,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:36:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:36:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:36:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 13:36:09,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:36:09,941 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:36:10,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:36:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:36:10,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 3475 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 13:36:10,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:36:11,601 WARN L191 SmtUtils]: Spent 896.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-10-02 13:36:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:36:11,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:36:11,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [20] total 38 [2019-10-02 13:36:11,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 13:36:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 13:36:11,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1315, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 13:36:12,000 INFO L87 Difference]: Start difference. First operand 608714 states and 952995 transitions. Second operand 38 states.