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_spec3_product13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:58:58,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:58:58,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:58:58,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:58:58,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:58:58,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:58:58,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:58:58,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:58:58,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:58:58,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:58:58,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:58:58,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:58:58,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:58:58,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:58:58,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:58:58,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:58:58,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:58:58,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:58:58,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:58:58,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:58:58,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:58:58,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:58:58,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:58:58,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:58:58,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:58:58,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:58:58,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:58:58,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:58:58,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:58:58,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:58:58,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:58:58,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:58:58,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:58:58,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:58:58,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:58:58,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:58:58,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:58:58,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:58:58,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:58:58,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:58:58,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:58:58,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:58:58,171 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:58:58,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:58:58,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:58:58,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:58:58,174 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:58:58,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:58:58,175 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:58:58,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:58:58,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:58:58,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:58:58,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:58:58,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:58:58,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:58:58,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:58:58,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:58:58,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:58:58,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:58:58,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:58:58,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:58:58,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:58:58,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:58:58,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:58:58,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:58:58,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:58:58,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:58:58,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:58:58,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:58:58,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:58:58,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:58:58,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:58:58,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:58:58,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:58:58,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:58:58,254 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:58:58,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product13.cil.c [2019-09-08 04:58:58,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363fc76b7/08db9eb203564d3b8cf14d61f1cf173b/FLAG04a9a148a [2019-09-08 04:58:58,982 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:58:58,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product13.cil.c [2019-09-08 04:58:59,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363fc76b7/08db9eb203564d3b8cf14d61f1cf173b/FLAG04a9a148a [2019-09-08 04:58:59,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363fc76b7/08db9eb203564d3b8cf14d61f1cf173b [2019-09-08 04:58:59,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:58:59,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:58:59,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:58:59,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:58:59,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:58:59,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:58:59" (1/1) ... [2019-09-08 04:58:59,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74340391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:58:59, skipping insertion in model container [2019-09-08 04:58:59,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:58:59" (1/1) ... [2019-09-08 04:58:59,239 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:58:59,323 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:59:00,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:59:00,134 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:59:00,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:59:00,318 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:59:00,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00 WrapperNode [2019-09-08 04:59:00,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:59:00,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:59:00,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:59:00,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:59:00,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... [2019-09-08 04:59:00,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:59:00,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:59:00,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:59:00,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:59:00,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:59:00,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:59:00,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:59:00,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:59:00,632 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:59:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:59:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:59:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:59:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 04:59:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 04:59:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:59:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:59:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:59:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:59:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:59:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:59:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:59:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:59:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:59:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:59:00,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:59:00,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:59:00,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:59:00,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:59:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:59:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:59:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:59:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:59:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:59:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:59:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:59:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:59:00,639 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:59:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:59:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:59:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:59:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:59:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:59:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:59:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:59:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:59:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:59:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:59:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:59:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:59:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:59:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:59:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:59:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:59:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:59:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:59:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:59:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:59:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:59:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:59:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:59:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:59:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:59:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:59:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:59:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:59:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:59:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:59:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:59:00,646 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:59:00,646 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:59:00,646 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:59:00,646 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:59:00,647 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 04:59:00,647 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:59:00,647 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:59:00,647 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:59:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:59:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:59:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:59:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:59:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:59:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:59:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:59:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:59:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:59:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:59:00,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:59:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:59:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:59:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:59:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:59:00,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:59:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:59:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:59:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:59:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:59:00,651 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:59:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:59:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:59:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:59:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:59:00,652 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:59:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:59:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:59:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:59:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:59:00,653 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:59:00,654 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:59:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:59:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:59:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:59:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:59:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:59:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:59:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:59:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:59:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:59:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:59:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:59:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:59:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:59:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:59:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 04:59:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:59:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 04:59:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:59:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:59:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:59:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:59:00,658 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:59:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:59:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:59:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:59:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:59:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:59:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:59:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:59:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:59:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:59:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:59:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:59:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:59:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:59:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:59:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:59:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:59:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:59:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:59:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:59:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:59:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:59:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:59:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:59:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:59:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:59:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:59:00,666 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:59:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:59:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:59:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:59:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:59:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:59:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:59:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:59:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:59:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:59:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:59:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:59:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:59:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:59:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:59:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:59:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:59:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:59:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:59:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:59:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 04:59:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:59:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:59:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:59:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:59:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:59:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:59:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:59:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:59:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:59:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:59:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:59:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:59:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:59:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:59:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:59:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:59:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:59:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:59:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:59:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:59:03,031 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:59:03,033 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:59:03,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:59:03 BoogieIcfgContainer [2019-09-08 04:59:03,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:59:03,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:59:03,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:59:03,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:59:03,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:58:59" (1/3) ... [2019-09-08 04:59:03,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d21852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:59:03, skipping insertion in model container [2019-09-08 04:59:03,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:59:00" (2/3) ... [2019-09-08 04:59:03,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d21852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:59:03, skipping insertion in model container [2019-09-08 04:59:03,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:59:03" (3/3) ... [2019-09-08 04:59:03,045 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product13.cil.c [2019-09-08 04:59:03,057 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:59:03,071 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:59:03,091 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:59:03,148 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:59:03,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:59:03,149 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:59:03,149 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:59:03,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:59:03,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:59:03,150 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:59:03,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:59:03,150 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:59:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states. [2019-09-08 04:59:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 04:59:03,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:03,231 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:03,235 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 772821080, now seen corresponding path program 1 times [2019-09-08 04:59:03,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:03,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:03,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:03,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:59:03,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:59:03,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:59:03,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:59:03,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:59:03,888 INFO L87 Difference]: Start difference. First operand 459 states. Second operand 2 states. [2019-09-08 04:59:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:03,961 INFO L93 Difference]: Finished difference Result 627 states and 831 transitions. [2019-09-08 04:59:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:59:03,963 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 170 [2019-09-08 04:59:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:04,005 INFO L225 Difference]: With dead ends: 627 [2019-09-08 04:59:04,005 INFO L226 Difference]: Without dead ends: 414 [2019-09-08 04:59:04,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:59:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-08 04:59:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-09-08 04:59:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-08 04:59:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 551 transitions. [2019-09-08 04:59:04,197 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 551 transitions. Word has length 170 [2019-09-08 04:59:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:04,200 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 551 transitions. [2019-09-08 04:59:04,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:59:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 551 transitions. [2019-09-08 04:59:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:59:04,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:04,208 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:04,209 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -978519588, now seen corresponding path program 1 times [2019-09-08 04:59:04,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:04,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:59:04,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:04,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:59:04,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:59:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:59:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:04,570 INFO L87 Difference]: Start difference. First operand 414 states and 551 transitions. Second operand 3 states. [2019-09-08 04:59:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:04,634 INFO L93 Difference]: Finished difference Result 610 states and 796 transitions. [2019-09-08 04:59:04,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:04,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 04:59:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:04,639 INFO L225 Difference]: With dead ends: 610 [2019-09-08 04:59:04,640 INFO L226 Difference]: Without dead ends: 417 [2019-09-08 04:59:04,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-08 04:59:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 416. [2019-09-08 04:59:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-08 04:59:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 553 transitions. [2019-09-08 04:59:04,679 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 553 transitions. Word has length 171 [2019-09-08 04:59:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:04,681 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 553 transitions. [2019-09-08 04:59:04,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:59:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 553 transitions. [2019-09-08 04:59:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 04:59:04,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:04,687 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:04,688 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1778759344, now seen corresponding path program 1 times [2019-09-08 04:59:04,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:04,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:59:04,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:04,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:59:04,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:59:04,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:59:04,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:04,909 INFO L87 Difference]: Start difference. First operand 416 states and 553 transitions. Second operand 3 states. [2019-09-08 04:59:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:04,960 INFO L93 Difference]: Finished difference Result 806 states and 1101 transitions. [2019-09-08 04:59:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:59:04,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 04:59:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:04,971 INFO L225 Difference]: With dead ends: 806 [2019-09-08 04:59:04,972 INFO L226 Difference]: Without dead ends: 455 [2019-09-08 04:59:04,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:59:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-08 04:59:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 454. [2019-09-08 04:59:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-08 04:59:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 619 transitions. [2019-09-08 04:59:05,048 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 619 transitions. Word has length 177 [2019-09-08 04:59:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:05,049 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 619 transitions. [2019-09-08 04:59:05,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:59:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 619 transitions. [2019-09-08 04:59:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 04:59:05,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:05,054 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:05,054 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:05,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash -603589234, now seen corresponding path program 1 times [2019-09-08 04:59:05,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:05,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:05,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:59:05,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:05,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:59:05,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:59:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:59:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:59:05,329 INFO L87 Difference]: Start difference. First operand 454 states and 619 transitions. Second operand 12 states. [2019-09-08 04:59:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:13,450 INFO L93 Difference]: Finished difference Result 1819 states and 2403 transitions. [2019-09-08 04:59:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 04:59:13,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2019-09-08 04:59:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:13,480 INFO L225 Difference]: With dead ends: 1819 [2019-09-08 04:59:13,481 INFO L226 Difference]: Without dead ends: 1485 [2019-09-08 04:59:13,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 04:59:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-09-08 04:59:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1466. [2019-09-08 04:59:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-09-08 04:59:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1913 transitions. [2019-09-08 04:59:13,613 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1913 transitions. Word has length 178 [2019-09-08 04:59:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:13,614 INFO L475 AbstractCegarLoop]: Abstraction has 1466 states and 1913 transitions. [2019-09-08 04:59:13,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:59:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1913 transitions. [2019-09-08 04:59:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 04:59:13,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:13,626 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:13,627 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash 14445678, now seen corresponding path program 1 times [2019-09-08 04:59:13,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:13,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:13,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:13,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:13,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:59:13,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:13,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 04:59:13,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:59:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:59:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:59:13,924 INFO L87 Difference]: Start difference. First operand 1466 states and 1913 transitions. Second operand 16 states. [2019-09-08 04:59:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:14,282 INFO L93 Difference]: Finished difference Result 2325 states and 3021 transitions. [2019-09-08 04:59:14,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:59:14,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 179 [2019-09-08 04:59:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:14,290 INFO L225 Difference]: With dead ends: 2325 [2019-09-08 04:59:14,291 INFO L226 Difference]: Without dead ends: 1070 [2019-09-08 04:59:14,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:59:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2019-09-08 04:59:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 952. [2019-09-08 04:59:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-09-08 04:59:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1251 transitions. [2019-09-08 04:59:14,350 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1251 transitions. Word has length 179 [2019-09-08 04:59:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:14,351 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1251 transitions. [2019-09-08 04:59:14,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 04:59:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1251 transitions. [2019-09-08 04:59:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 04:59:14,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:14,355 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:14,355 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2119995647, now seen corresponding path program 1 times [2019-09-08 04:59:14,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:14,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:14,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:14,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:59:14,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:59:14,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:59:14,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:59:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:15,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 2462 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:59:15,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:59:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:59:15,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:59:15,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 04:59:15,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:59:15,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:59:15,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:59:15,414 INFO L87 Difference]: Start difference. First operand 952 states and 1251 transitions. Second operand 13 states. [2019-09-08 04:59:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:16,680 INFO L93 Difference]: Finished difference Result 1886 states and 2492 transitions. [2019-09-08 04:59:16,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:59:16,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 188 [2019-09-08 04:59:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:16,687 INFO L225 Difference]: With dead ends: 1886 [2019-09-08 04:59:16,687 INFO L226 Difference]: Without dead ends: 970 [2019-09-08 04:59:16,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:59:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-08 04:59:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-09-08 04:59:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-08 04:59:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1272 transitions. [2019-09-08 04:59:16,793 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1272 transitions. Word has length 188 [2019-09-08 04:59:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:16,794 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1272 transitions. [2019-09-08 04:59:16,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:59:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1272 transitions. [2019-09-08 04:59:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 04:59:16,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:16,799 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:16,799 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:16,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash 283611253, now seen corresponding path program 1 times [2019-09-08 04:59:16,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:16,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:16,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:16,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:16,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:59:17,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:17,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:59:17,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:59:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:59:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:59:17,051 INFO L87 Difference]: Start difference. First operand 968 states and 1272 transitions. Second operand 7 states. [2019-09-08 04:59:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:17,331 INFO L93 Difference]: Finished difference Result 1884 states and 2481 transitions. [2019-09-08 04:59:17,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:59:17,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-09-08 04:59:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:17,340 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 04:59:17,340 INFO L226 Difference]: Without dead ends: 982 [2019-09-08 04:59:17,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:59:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-08 04:59:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 978. [2019-09-08 04:59:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-09-08 04:59:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1283 transitions. [2019-09-08 04:59:17,403 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1283 transitions. Word has length 190 [2019-09-08 04:59:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:17,406 INFO L475 AbstractCegarLoop]: Abstraction has 978 states and 1283 transitions. [2019-09-08 04:59:17,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:59:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1283 transitions. [2019-09-08 04:59:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 04:59:17,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:17,411 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:17,411 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash 651742763, now seen corresponding path program 2 times [2019-09-08 04:59:17,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:17,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:17,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:59:17,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:17,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:59:17,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:59:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:59:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:59:17,626 INFO L87 Difference]: Start difference. First operand 978 states and 1283 transitions. Second operand 7 states. [2019-09-08 04:59:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:17,880 INFO L93 Difference]: Finished difference Result 1882 states and 2480 transitions. [2019-09-08 04:59:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:59:17,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-09-08 04:59:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:17,887 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 04:59:17,887 INFO L226 Difference]: Without dead ends: 984 [2019-09-08 04:59:17,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:59:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-08 04:59:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 980. [2019-09-08 04:59:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-09-08 04:59:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1286 transitions. [2019-09-08 04:59:17,943 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1286 transitions. Word has length 191 [2019-09-08 04:59:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:17,943 INFO L475 AbstractCegarLoop]: Abstraction has 980 states and 1286 transitions. [2019-09-08 04:59:17,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:59:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1286 transitions. [2019-09-08 04:59:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 04:59:17,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:17,947 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:17,947 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:17,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1316361914, now seen corresponding path program 1 times [2019-09-08 04:59:17,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:17,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:17,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:59:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:59:18,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:59:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:59:18,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:59:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:59:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:59:18,134 INFO L87 Difference]: Start difference. First operand 980 states and 1286 transitions. Second operand 9 states. [2019-09-08 04:59:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:18,523 INFO L93 Difference]: Finished difference Result 1887 states and 2486 transitions. [2019-09-08 04:59:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:59:18,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2019-09-08 04:59:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:18,534 INFO L225 Difference]: With dead ends: 1887 [2019-09-08 04:59:18,534 INFO L226 Difference]: Without dead ends: 982 [2019-09-08 04:59:18,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:59:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-09-08 04:59:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-09-08 04:59:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-09-08 04:59:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1285 transitions. [2019-09-08 04:59:18,635 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1285 transitions. Word has length 192 [2019-09-08 04:59:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:18,639 INFO L475 AbstractCegarLoop]: Abstraction has 980 states and 1285 transitions. [2019-09-08 04:59:18,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:59:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1285 transitions. [2019-09-08 04:59:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:59:18,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:18,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:18,645 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1781443312, now seen corresponding path program 2 times [2019-09-08 04:59:18,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:18,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:18,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:18,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:59:19,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:59:19,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:59:19,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:59:19,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 04:59:19,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 04:59:19,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:59:19,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:59:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:59:20,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:59:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [28] total 35 [2019-09-08 04:59:20,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 04:59:20,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 04:59:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1118, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 04:59:20,053 INFO L87 Difference]: Start difference. First operand 980 states and 1285 transitions. Second operand 35 states. [2019-09-08 04:59:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:45,197 INFO L93 Difference]: Finished difference Result 5517 states and 7270 transitions. [2019-09-08 04:59:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 04:59:45,199 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 193 [2019-09-08 04:59:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:45,226 INFO L225 Difference]: With dead ends: 5517 [2019-09-08 04:59:45,226 INFO L226 Difference]: Without dead ends: 4617 [2019-09-08 04:59:45,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=969, Invalid=10161, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 04:59:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-09-08 04:59:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2954. [2019-09-08 04:59:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-09-08 04:59:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3986 transitions. [2019-09-08 04:59:45,453 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3986 transitions. Word has length 193 [2019-09-08 04:59:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:45,454 INFO L475 AbstractCegarLoop]: Abstraction has 2954 states and 3986 transitions. [2019-09-08 04:59:45,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 04:59:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3986 transitions. [2019-09-08 04:59:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 04:59:45,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:45,463 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:45,463 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -563566404, now seen corresponding path program 1 times [2019-09-08 04:59:45,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:45,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 04:59:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:59:45,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:59:45,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:59:45,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:46,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 2465 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:59:46,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:59:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 04:59:46,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:59:46,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [28] total 35 [2019-09-08 04:59:46,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 04:59:46,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 04:59:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 04:59:46,599 INFO L87 Difference]: Start difference. First operand 2954 states and 3986 transitions. Second operand 35 states. [2019-09-08 05:00:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:11,781 INFO L93 Difference]: Finished difference Result 10903 states and 14623 transitions. [2019-09-08 05:00:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 05:00:11,781 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 194 [2019-09-08 05:00:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:11,831 INFO L225 Difference]: With dead ends: 10903 [2019-09-08 05:00:11,831 INFO L226 Difference]: Without dead ends: 8074 [2019-09-08 05:00:11,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2362 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1092, Invalid=9620, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 05:00:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-08 05:00:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 6352. [2019-09-08 05:00:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-09-08 05:00:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 8608 transitions. [2019-09-08 05:00:12,379 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 8608 transitions. Word has length 194 [2019-09-08 05:00:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:12,380 INFO L475 AbstractCegarLoop]: Abstraction has 6352 states and 8608 transitions. [2019-09-08 05:00:12,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 05:00:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 8608 transitions. [2019-09-08 05:00:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 05:00:12,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:12,398 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:12,398 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash -800709958, now seen corresponding path program 1 times [2019-09-08 05:00:12,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:12,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:12,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:00:12,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:12,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:00:12,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:00:12,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:00:12,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:00:12,860 INFO L87 Difference]: Start difference. First operand 6352 states and 8608 transitions. Second operand 21 states. [2019-09-08 05:00:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:14,480 INFO L93 Difference]: Finished difference Result 9531 states and 12874 transitions. [2019-09-08 05:00:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:00:14,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 195 [2019-09-08 05:00:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:14,537 INFO L225 Difference]: With dead ends: 9531 [2019-09-08 05:00:14,537 INFO L226 Difference]: Without dead ends: 7265 [2019-09-08 05:00:14,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:00:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2019-09-08 05:00:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 6916. [2019-09-08 05:00:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6916 states. [2019-09-08 05:00:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 9450 transitions. [2019-09-08 05:00:15,154 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 9450 transitions. Word has length 195 [2019-09-08 05:00:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:15,154 INFO L475 AbstractCegarLoop]: Abstraction has 6916 states and 9450 transitions. [2019-09-08 05:00:15,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:00:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 9450 transitions. [2019-09-08 05:00:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 05:00:15,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:15,171 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:15,171 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1207758974, now seen corresponding path program 1 times [2019-09-08 05:00:15,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:15,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:15,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 05:00:15,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:00:15,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:00:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:15,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 2469 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:00:15,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:00:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:16,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:00:16,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 4] total 30 [2019-09-08 05:00:16,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 05:00:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 05:00:16,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:00:16,101 INFO L87 Difference]: Start difference. First operand 6916 states and 9450 transitions. Second operand 30 states. [2019-09-08 05:00:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:37,461 INFO L93 Difference]: Finished difference Result 21820 states and 29550 transitions. [2019-09-08 05:00:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 05:00:37,461 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 195 [2019-09-08 05:00:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:37,532 INFO L225 Difference]: With dead ends: 21820 [2019-09-08 05:00:37,532 INFO L226 Difference]: Without dead ends: 16635 [2019-09-08 05:00:37,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=808, Invalid=7202, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 05:00:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16635 states. [2019-09-08 05:00:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16635 to 15301. [2019-09-08 05:00:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15301 states. [2019-09-08 05:00:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 20997 transitions. [2019-09-08 05:00:39,420 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 20997 transitions. Word has length 195 [2019-09-08 05:00:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:39,421 INFO L475 AbstractCegarLoop]: Abstraction has 15301 states and 20997 transitions. [2019-09-08 05:00:39,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 05:00:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 20997 transitions. [2019-09-08 05:00:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:00:39,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:39,452 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:39,452 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:39,453 INFO L82 PathProgramCache]: Analyzing trace with hash 624926798, now seen corresponding path program 1 times [2019-09-08 05:00:39,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:39,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:39,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:39,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:39,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:39,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:39,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:39,567 INFO L87 Difference]: Start difference. First operand 15301 states and 20997 transitions. Second operand 3 states. [2019-09-08 05:00:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:40,038 INFO L93 Difference]: Finished difference Result 31668 states and 44155 transitions. [2019-09-08 05:00:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:40,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-08 05:00:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:40,110 INFO L225 Difference]: With dead ends: 31668 [2019-09-08 05:00:40,111 INFO L226 Difference]: Without dead ends: 16546 [2019-09-08 05:00:40,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2019-09-08 05:00:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 16537. [2019-09-08 05:00:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16537 states. [2019-09-08 05:00:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16537 states to 16537 states and 23327 transitions. [2019-09-08 05:00:41,351 INFO L78 Accepts]: Start accepts. Automaton has 16537 states and 23327 transitions. Word has length 201 [2019-09-08 05:00:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:41,351 INFO L475 AbstractCegarLoop]: Abstraction has 16537 states and 23327 transitions. [2019-09-08 05:00:41,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 16537 states and 23327 transitions. [2019-09-08 05:00:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:00:41,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:41,385 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:41,385 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1542431685, now seen corresponding path program 1 times [2019-09-08 05:00:41,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:41,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:41,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:41,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:41,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:00:41,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:00:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:00:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:41,515 INFO L87 Difference]: Start difference. First operand 16537 states and 23327 transitions. Second operand 6 states. [2019-09-08 05:00:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:42,102 INFO L93 Difference]: Finished difference Result 32796 states and 46271 transitions. [2019-09-08 05:00:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:00:42,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-09-08 05:00:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:42,175 INFO L225 Difference]: With dead ends: 32796 [2019-09-08 05:00:42,175 INFO L226 Difference]: Without dead ends: 16546 [2019-09-08 05:00:42,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2019-09-08 05:00:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 15780. [2019-09-08 05:00:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15780 states. [2019-09-08 05:00:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15780 states to 15780 states and 22322 transitions. [2019-09-08 05:00:43,499 INFO L78 Accepts]: Start accepts. Automaton has 15780 states and 22322 transitions. Word has length 202 [2019-09-08 05:00:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:43,500 INFO L475 AbstractCegarLoop]: Abstraction has 15780 states and 22322 transitions. [2019-09-08 05:00:43,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:00:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15780 states and 22322 transitions. [2019-09-08 05:00:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:00:43,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:43,535 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:43,535 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash -724970732, now seen corresponding path program 1 times [2019-09-08 05:00:43,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:43,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:43,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:43,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:43,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:43,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:43,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:43,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:43,688 INFO L87 Difference]: Start difference. First operand 15780 states and 22322 transitions. Second operand 3 states. [2019-09-08 05:00:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:44,196 INFO L93 Difference]: Finished difference Result 33685 states and 48828 transitions. [2019-09-08 05:00:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:44,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-08 05:00:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:44,286 INFO L225 Difference]: With dead ends: 33685 [2019-09-08 05:00:44,287 INFO L226 Difference]: Without dead ends: 18096 [2019-09-08 05:00:44,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18096 states. [2019-09-08 05:00:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18096 to 18088. [2019-09-08 05:00:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18088 states. [2019-09-08 05:00:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18088 states to 18088 states and 26660 transitions. [2019-09-08 05:00:46,485 INFO L78 Accepts]: Start accepts. Automaton has 18088 states and 26660 transitions. Word has length 202 [2019-09-08 05:00:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:46,486 INFO L475 AbstractCegarLoop]: Abstraction has 18088 states and 26660 transitions. [2019-09-08 05:00:46,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18088 states and 26660 transitions. [2019-09-08 05:00:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:00:46,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:46,528 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:46,528 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash -232887440, now seen corresponding path program 1 times [2019-09-08 05:00:46,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:46,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:46,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:46,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:46,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:46,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:46,690 INFO L87 Difference]: Start difference. First operand 18088 states and 26660 transitions. Second operand 3 states. [2019-09-08 05:00:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:47,455 INFO L93 Difference]: Finished difference Result 40407 states and 61312 transitions. [2019-09-08 05:00:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:47,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-08 05:00:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:47,546 INFO L225 Difference]: With dead ends: 40407 [2019-09-08 05:00:47,546 INFO L226 Difference]: Without dead ends: 22528 [2019-09-08 05:00:47,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22528 states. [2019-09-08 05:00:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22528 to 22520. [2019-09-08 05:00:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22520 states. [2019-09-08 05:00:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22520 states to 22520 states and 34770 transitions. [2019-09-08 05:00:49,016 INFO L78 Accepts]: Start accepts. Automaton has 22520 states and 34770 transitions. Word has length 203 [2019-09-08 05:00:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:49,016 INFO L475 AbstractCegarLoop]: Abstraction has 22520 states and 34770 transitions. [2019-09-08 05:00:49,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 22520 states and 34770 transitions. [2019-09-08 05:00:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:00:49,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:49,044 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:49,044 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -306967308, now seen corresponding path program 1 times [2019-09-08 05:00:49,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:49,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:49,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:49,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:49,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:49,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:49,154 INFO L87 Difference]: Start difference. First operand 22520 states and 34770 transitions. Second operand 3 states. [2019-09-08 05:00:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:50,010 INFO L93 Difference]: Finished difference Result 53273 states and 84756 transitions. [2019-09-08 05:00:50,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:50,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 05:00:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:50,143 INFO L225 Difference]: With dead ends: 53273 [2019-09-08 05:00:50,143 INFO L226 Difference]: Without dead ends: 30992 [2019-09-08 05:00:50,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:50,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30992 states. [2019-09-08 05:00:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30992 to 30984. [2019-09-08 05:00:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30984 states. [2019-09-08 05:00:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30984 states to 30984 states and 50016 transitions. [2019-09-08 05:00:52,013 INFO L78 Accepts]: Start accepts. Automaton has 30984 states and 50016 transitions. Word has length 204 [2019-09-08 05:00:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:52,013 INFO L475 AbstractCegarLoop]: Abstraction has 30984 states and 50016 transitions. [2019-09-08 05:00:52,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30984 states and 50016 transitions. [2019-09-08 05:00:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 05:00:52,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:52,082 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:52,083 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1850990192, now seen corresponding path program 1 times [2019-09-08 05:00:52,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:52,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:52,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:52,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:52,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:52,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:52,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:52,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:52,195 INFO L87 Difference]: Start difference. First operand 30984 states and 50016 transitions. Second operand 3 states. [2019-09-08 05:00:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:53,860 INFO L93 Difference]: Finished difference Result 78873 states and 131086 transitions. [2019-09-08 05:00:53,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:53,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 05:00:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:54,008 INFO L225 Difference]: With dead ends: 78873 [2019-09-08 05:00:54,008 INFO L226 Difference]: Without dead ends: 48148 [2019-09-08 05:00:54,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48148 states. [2019-09-08 05:00:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48148 to 48140. [2019-09-08 05:00:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48140 states. [2019-09-08 05:00:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48140 states to 48140 states and 80866 transitions. [2019-09-08 05:00:56,514 INFO L78 Accepts]: Start accepts. Automaton has 48140 states and 80866 transitions. Word has length 205 [2019-09-08 05:00:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:56,514 INFO L475 AbstractCegarLoop]: Abstraction has 48140 states and 80866 transitions. [2019-09-08 05:00:56,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 48140 states and 80866 transitions. [2019-09-08 05:00:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 05:00:56,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:56,629 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:56,630 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash -507124012, now seen corresponding path program 1 times [2019-09-08 05:00:56,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:56,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:00:56,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:56,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:56,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:56,770 INFO L87 Difference]: Start difference. First operand 48140 states and 80866 transitions. Second operand 3 states. [2019-09-08 05:01:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:00,418 INFO L93 Difference]: Finished difference Result 127765 states and 219522 transitions. [2019-09-08 05:01:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:00,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-08 05:01:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:00,661 INFO L225 Difference]: With dead ends: 127765 [2019-09-08 05:01:00,661 INFO L226 Difference]: Without dead ends: 79896 [2019-09-08 05:01:00,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79896 states. [2019-09-08 05:01:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79896 to 79888. [2019-09-08 05:01:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79888 states. [2019-09-08 05:01:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79888 states to 79888 states and 137956 transitions. [2019-09-08 05:01:07,355 INFO L78 Accepts]: Start accepts. Automaton has 79888 states and 137956 transitions. Word has length 206 [2019-09-08 05:01:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:07,355 INFO L475 AbstractCegarLoop]: Abstraction has 79888 states and 137956 transitions. [2019-09-08 05:01:07,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:01:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 79888 states and 137956 transitions. [2019-09-08 05:01:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 05:01:07,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:07,556 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:07,557 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash 16529216, now seen corresponding path program 1 times [2019-09-08 05:01:07,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:07,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:07,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:01:07,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:01:07,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:01:07,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:08,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:01:08,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:01:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:01:08,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:01:08,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:01:08,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:01:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:01:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:01:08,105 INFO L87 Difference]: Start difference. First operand 79888 states and 137956 transitions. Second operand 6 states. [2019-09-08 05:01:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:10,914 INFO L93 Difference]: Finished difference Result 93392 states and 156329 transitions. [2019-09-08 05:01:10,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:01:10,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-08 05:01:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:11,180 INFO L225 Difference]: With dead ends: 93392 [2019-09-08 05:01:11,180 INFO L226 Difference]: Without dead ends: 82303 [2019-09-08 05:01:11,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:01:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82303 states. [2019-09-08 05:01:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82303 to 82058. [2019-09-08 05:01:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82058 states. [2019-09-08 05:01:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82058 states to 82058 states and 141442 transitions. [2019-09-08 05:01:17,794 INFO L78 Accepts]: Start accepts. Automaton has 82058 states and 141442 transitions. Word has length 213 [2019-09-08 05:01:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:17,795 INFO L475 AbstractCegarLoop]: Abstraction has 82058 states and 141442 transitions. [2019-09-08 05:01:17,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:01:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 82058 states and 141442 transitions. [2019-09-08 05:01:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 05:01:18,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:18,005 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:18,005 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1664500366, now seen corresponding path program 1 times [2019-09-08 05:01:18,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:18,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:18,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:18,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:18,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:01:18,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:18,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:01:18,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:01:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:01:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:18,127 INFO L87 Difference]: Start difference. First operand 82058 states and 141442 transitions. Second operand 3 states. [2019-09-08 05:01:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:25,024 INFO L93 Difference]: Finished difference Result 227363 states and 397254 transitions. [2019-09-08 05:01:25,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:25,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 05:01:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:25,522 INFO L225 Difference]: With dead ends: 227363 [2019-09-08 05:01:25,523 INFO L226 Difference]: Without dead ends: 146768 [2019-09-08 05:01:25,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146768 states. [2019-09-08 05:01:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146768 to 146760. [2019-09-08 05:01:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146760 states. [2019-09-08 05:01:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146760 states to 146760 states and 255840 transitions. [2019-09-08 05:01:36,694 INFO L78 Accepts]: Start accepts. Automaton has 146760 states and 255840 transitions. Word has length 207 [2019-09-08 05:01:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:36,695 INFO L475 AbstractCegarLoop]: Abstraction has 146760 states and 255840 transitions. [2019-09-08 05:01:36,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:01:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 146760 states and 255840 transitions. [2019-09-08 05:01:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 05:01:37,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:37,094 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:37,094 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1121052428, now seen corresponding path program 1 times [2019-09-08 05:01:37,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:37,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:01:37,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:37,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:01:37,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:01:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:01:37,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:37,209 INFO L87 Difference]: Start difference. First operand 146760 states and 255840 transitions. Second operand 3 states. [2019-09-08 05:01:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:50,801 INFO L93 Difference]: Finished difference Result 411033 states and 717642 transitions. [2019-09-08 05:01:50,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:50,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 05:01:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:52,578 INFO L225 Difference]: With dead ends: 411033 [2019-09-08 05:01:52,579 INFO L226 Difference]: Without dead ends: 266072 [2019-09-08 05:01:52,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266072 states. [2019-09-08 05:02:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266072 to 266064. [2019-09-08 05:02:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266064 states. [2019-09-08 05:02:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266064 states to 266064 states and 460324 transitions. [2019-09-08 05:02:14,227 INFO L78 Accepts]: Start accepts. Automaton has 266064 states and 460324 transitions. Word has length 208 [2019-09-08 05:02:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:02:14,227 INFO L475 AbstractCegarLoop]: Abstraction has 266064 states and 460324 transitions. [2019-09-08 05:02:14,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:02:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 266064 states and 460324 transitions. [2019-09-08 05:02:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 05:02:14,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:02:14,947 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:02:14,947 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:02:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:02:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1933808020, now seen corresponding path program 1 times [2019-09-08 05:02:14,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:02:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:02:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:14,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:02:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:02:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:02:15,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:02:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:02:15,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:02:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:02:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:02:15,049 INFO L87 Difference]: Start difference. First operand 266064 states and 460324 transitions. Second operand 3 states. [2019-09-08 05:02:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:02:45,509 INFO L93 Difference]: Finished difference Result 755225 states and 1314712 transitions. [2019-09-08 05:02:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:02:45,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 05:02:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:02:48,269 INFO L225 Difference]: With dead ends: 755225 [2019-09-08 05:02:48,269 INFO L226 Difference]: Without dead ends: 491558 [2019-09-08 05:02:48,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:02:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491558 states. [2019-09-08 05:03:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491558 to 491550. [2019-09-08 05:03:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491550 states. [2019-09-08 05:03:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491550 states to 491550 states and 849666 transitions. [2019-09-08 05:03:44,339 INFO L78 Accepts]: Start accepts. Automaton has 491550 states and 849666 transitions. Word has length 209 [2019-09-08 05:03:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:03:44,340 INFO L475 AbstractCegarLoop]: Abstraction has 491550 states and 849666 transitions. [2019-09-08 05:03:44,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:03:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 491550 states and 849666 transitions. [2019-09-08 05:03:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:03:45,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:03:45,854 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:03:45,854 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:03:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:03:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1857117356, now seen corresponding path program 1 times [2019-09-08 05:03:45,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:03:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:03:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:45,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:03:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:03:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:03:45,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:03:45,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:03:45,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:03:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:03:45,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:03:45,976 INFO L87 Difference]: Start difference. First operand 491550 states and 849666 transitions. Second operand 3 states. [2019-09-08 05:04:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:50,563 INFO L93 Difference]: Finished difference Result 929071 states and 1585614 transitions. [2019-09-08 05:04:50,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:04:50,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-08 05:04:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:54,021 INFO L225 Difference]: With dead ends: 929071 [2019-09-08 05:04:54,022 INFO L226 Difference]: Without dead ends: 917982 [2019-09-08 05:04:54,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:04:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917982 states. [2019-09-08 05:06:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917982 to 917974. [2019-09-08 05:06:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917974 states. [2019-09-08 05:06:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917974 states to 917974 states and 1554764 transitions. [2019-09-08 05:06:35,198 INFO L78 Accepts]: Start accepts. Automaton has 917974 states and 1554764 transitions. Word has length 210 [2019-09-08 05:06:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:35,198 INFO L475 AbstractCegarLoop]: Abstraction has 917974 states and 1554764 transitions. [2019-09-08 05:06:35,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 917974 states and 1554764 transitions. [2019-09-08 05:06:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:06:53,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:53,784 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:53,784 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1308362548, now seen corresponding path program 1 times [2019-09-08 05:06:53,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:53,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:53,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:54,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:54,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:06:54,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:06:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:06:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:06:54,301 INFO L87 Difference]: Start difference. First operand 917974 states and 1554764 transitions. Second operand 21 states. [2019-09-08 05:07:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:54,284 INFO L93 Difference]: Finished difference Result 935854 states and 1578332 transitions. [2019-09-08 05:07:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:07:54,285 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 211 [2019-09-08 05:07:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:57,343 INFO L225 Difference]: With dead ends: 935854 [2019-09-08 05:07:57,343 INFO L226 Difference]: Without dead ends: 929826 [2019-09-08 05:07:57,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 05:07:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929826 states.