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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:55:06,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:55:06,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:55:06,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:55:06,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:55:06,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:55:06,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:55:06,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:55:06,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:55:06,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:55:06,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:55:06,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:55:06,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:55:06,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:55:06,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:55:06,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:55:06,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:55:06,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:55:06,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:55:06,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:55:06,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:55:06,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:55:06,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:55:06,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:55:06,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:55:06,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:55:06,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:55:06,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:55:06,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:55:06,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:55:06,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:55:06,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:55:06,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:55:06,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:55:06,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:55:06,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:55:06,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:55:06,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:55:06,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:55:06,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:55:06,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:55:06,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:55:06,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:55:06,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:55:06,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:55:06,222 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:55:06,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:55:06,223 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:55:06,223 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:55:06,224 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:55:06,224 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:55:06,225 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:55:06,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:55:06,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:55:06,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:55:06,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:55:06,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:55:06,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:55:06,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:55:06,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:55:06,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:55:06,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:55:06,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:55:06,229 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:55:06,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:55:06,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:55:06,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:55:06,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:55:06,230 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:55:06,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:55:06,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:55:06,231 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:55:06,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:55:06,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:55:06,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:55:06,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:55:06,307 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:55:06,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c [2019-10-03 02:55:06,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2c064bf/9a378c0a890a4aa28a93176b43595081/FLAGfc1fe3723 [2019-10-03 02:55:07,121 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:55:07,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c [2019-10-03 02:55:07,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2c064bf/9a378c0a890a4aa28a93176b43595081/FLAGfc1fe3723 [2019-10-03 02:55:07,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2c064bf/9a378c0a890a4aa28a93176b43595081 [2019-10-03 02:55:07,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:55:07,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:55:07,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:55:07,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:55:07,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:55:07,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:55:07" (1/1) ... [2019-10-03 02:55:07,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54af5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:07, skipping insertion in model container [2019-10-03 02:55:07,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:55:07" (1/1) ... [2019-10-03 02:55:07,248 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:55:07,321 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:55:08,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:55:08,115 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:55:08,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:55:08,507 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:55:08,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08 WrapperNode [2019-10-03 02:55:08,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:55:08,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:55:08,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:55:08,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:55:08,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... [2019-10-03 02:55:08,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:55:08,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:55:08,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:55:08,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:55:08,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:55:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:55:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:55:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:55:08,793 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:55:08,793 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-03 02:55:08,793 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-03 02:55:08,793 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-03 02:55:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-03 02:55:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-03 02:55:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-03 02:55:08,794 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:55:08,795 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:55:08,795 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-03 02:55:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-03 02:55:08,796 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-03 02:55:08,797 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-03 02:55:08,797 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-03 02:55:08,798 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-03 02:55:08,798 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-03 02:55:08,798 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-03 02:55:08,799 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:55:08,799 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:55:08,799 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:55:08,799 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:55:08,800 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:55:08,801 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:55:08,801 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:55:08,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:55:08,802 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:55:08,802 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:55:08,802 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:55:08,802 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:55:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:55:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:55:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:55:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:55:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:55:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:55:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:55:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:55:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:55:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:55:08,804 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:55:08,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:55:08,805 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:55:08,805 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:55:08,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:55:08,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:55:08,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:55:08,806 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:55:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:55:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:55:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:55:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:55:08,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:55:08,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-03 02:55:08,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-03 02:55:08,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:55:08,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-03 02:55:08,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-03 02:55:08,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:55:08,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-03 02:55:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-03 02:55:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:55:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:55:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:55:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:55:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:55:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:55:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:55:08,812 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:55:08,812 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:55:08,812 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:55:08,813 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:55:08,813 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:55:08,813 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:55:08,813 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:55:08,814 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:55:08,814 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:55:08,814 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:55:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:55:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-03 02:55:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-03 02:55:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-03 02:55:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-03 02:55:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-03 02:55:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-03 02:55:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:55:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-03 02:55:08,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-03 02:55:08,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:55:08,818 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:55:08,818 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:55:08,818 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:55:08,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:55:08,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:55:08,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:55:08,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:55:08,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:55:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:55:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:55:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:55:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:55:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:55:08,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:55:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:55:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:55:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:55:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:55:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:55:08,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:55:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:55:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:55:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:55:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:55:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:55:08,823 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:55:08,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:55:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:55:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:55:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:55:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:55:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:55:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:55:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:55:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:55:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:55:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:55:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:55:08,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:55:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:55:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:55:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:55:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:55:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:55:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:55:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:55:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:55:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:55:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:55:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:55:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:55:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:55:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:55:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:55:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:55:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:55:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:55:08,859 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:55:08,859 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:55:08,859 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:55:08,859 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:55:08,859 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:55:08,859 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:55:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:55:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:55:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:55:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:55:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:55:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:55:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:55:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:55:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:55:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:55:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:55:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:55:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:55:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:55:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:55:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:55:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-03 02:55:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-03 02:55:08,863 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-03 02:55:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-03 02:55:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-03 02:55:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-03 02:55:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-03 02:55:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-03 02:55:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:55:08,865 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:55:08,866 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:55:08,867 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:55:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:55:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:55:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-03 02:55:08,871 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-03 02:55:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-03 02:55:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-03 02:55:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:55:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:55:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:55:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:55:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:55:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:55:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:55:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:55:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:55:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:55:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:55:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:55:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:55:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:55:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:55:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:55:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:55:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:55:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:55:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:55:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:55:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:55:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:55:08,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:55:11,389 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:55:11,390 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:55:11,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:55:11 BoogieIcfgContainer [2019-10-03 02:55:11,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:55:11,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:55:11,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:55:11,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:55:11,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:55:07" (1/3) ... [2019-10-03 02:55:11,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7089fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:55:11, skipping insertion in model container [2019-10-03 02:55:11,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:55:08" (2/3) ... [2019-10-03 02:55:11,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7089fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:55:11, skipping insertion in model container [2019-10-03 02:55:11,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:55:11" (3/3) ... [2019-10-03 02:55:11,408 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_productSimulator.cil.c [2019-10-03 02:55:11,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:55:11,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:55:11,457 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:55:11,489 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:55:11,490 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:55:11,490 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:55:11,490 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:55:11,490 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:55:11,490 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:55:11,491 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:55:11,491 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:55:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states. [2019-10-03 02:55:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-03 02:55:11,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:11,601 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:11,605 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1981240698, now seen corresponding path program 1 times [2019-10-03 02:55:11,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:11,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:55:12,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:55:12,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:12,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:55:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:55:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:12,571 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 6 states. [2019-10-03 02:55:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:12,779 INFO L93 Difference]: Finished difference Result 798 states and 1089 transitions. [2019-10-03 02:55:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:55:12,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-10-03 02:55:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:12,825 INFO L225 Difference]: With dead ends: 798 [2019-10-03 02:55:12,825 INFO L226 Difference]: Without dead ends: 781 [2019-10-03 02:55:12,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-03 02:55:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2019-10-03 02:55:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-03 02:55:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1063 transitions. [2019-10-03 02:55:12,939 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1063 transitions. Word has length 190 [2019-10-03 02:55:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:12,942 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1063 transitions. [2019-10-03 02:55:12,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:55:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1063 transitions. [2019-10-03 02:55:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:55:12,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:12,950 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:12,951 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash 109619264, now seen corresponding path program 1 times [2019-10-03 02:55:12,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:12,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:12,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:55:13,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:13,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:55:13,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:13,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:55:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:55:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:55:13,194 INFO L87 Difference]: Start difference. First operand 781 states and 1063 transitions. Second operand 4 states. [2019-10-03 02:55:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:14,114 INFO L93 Difference]: Finished difference Result 782 states and 1058 transitions. [2019-10-03 02:55:14,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:55:14,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-10-03 02:55:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:14,122 INFO L225 Difference]: With dead ends: 782 [2019-10-03 02:55:14,123 INFO L226 Difference]: Without dead ends: 782 [2019-10-03 02:55:14,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:55:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-10-03 02:55:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-10-03 02:55:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-10-03 02:55:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1058 transitions. [2019-10-03 02:55:14,164 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1058 transitions. Word has length 196 [2019-10-03 02:55:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:14,165 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1058 transitions. [2019-10-03 02:55:14,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:55:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1058 transitions. [2019-10-03 02:55:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:55:14,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:14,170 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:14,171 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 818687885, now seen corresponding path program 1 times [2019-10-03 02:55:14,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:14,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:14,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:55:14,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:14,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:14,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:14,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:14,349 INFO L87 Difference]: Start difference. First operand 782 states and 1058 transitions. Second operand 3 states. [2019-10-03 02:55:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:14,494 INFO L93 Difference]: Finished difference Result 1487 states and 2035 transitions. [2019-10-03 02:55:14,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:14,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-03 02:55:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:14,518 INFO L225 Difference]: With dead ends: 1487 [2019-10-03 02:55:14,519 INFO L226 Difference]: Without dead ends: 1485 [2019-10-03 02:55:14,520 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-10-03 02:55:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2019-10-03 02:55:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2019-10-03 02:55:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2031 transitions. [2019-10-03 02:55:14,648 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2031 transitions. Word has length 197 [2019-10-03 02:55:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:14,649 INFO L475 AbstractCegarLoop]: Abstraction has 1482 states and 2031 transitions. [2019-10-03 02:55:14,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2031 transitions. [2019-10-03 02:55:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:55:14,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:14,740 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:14,741 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1701488253, now seen corresponding path program 1 times [2019-10-03 02:55:14,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:14,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:55:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:14,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:14,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:14,967 INFO L87 Difference]: Start difference. First operand 1482 states and 2031 transitions. Second operand 3 states. [2019-10-03 02:55:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:15,095 INFO L93 Difference]: Finished difference Result 783 states and 1052 transitions. [2019-10-03 02:55:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:15,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-03 02:55:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:15,102 INFO L225 Difference]: With dead ends: 783 [2019-10-03 02:55:15,103 INFO L226 Difference]: Without dead ends: 783 [2019-10-03 02:55:15,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-03 02:55:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2019-10-03 02:55:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-03 02:55:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1052 transitions. [2019-10-03 02:55:15,128 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1052 transitions. Word has length 198 [2019-10-03 02:55:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:15,128 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1052 transitions. [2019-10-03 02:55:15,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1052 transitions. [2019-10-03 02:55:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:55:15,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:15,133 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:15,134 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1151446893, now seen corresponding path program 1 times [2019-10-03 02:55:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:15,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:15,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-03 02:55:15,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:15,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:55:15,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:15,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:55:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:55:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:55:15,322 INFO L87 Difference]: Start difference. First operand 783 states and 1052 transitions. Second operand 4 states. [2019-10-03 02:55:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:16,153 INFO L93 Difference]: Finished difference Result 789 states and 1043 transitions. [2019-10-03 02:55:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:55:16,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-10-03 02:55:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:16,159 INFO L225 Difference]: With dead ends: 789 [2019-10-03 02:55:16,159 INFO L226 Difference]: Without dead ends: 789 [2019-10-03 02:55:16,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:55:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-03 02:55:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 783. [2019-10-03 02:55:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-03 02:55:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1037 transitions. [2019-10-03 02:55:16,182 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1037 transitions. Word has length 212 [2019-10-03 02:55:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:16,183 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1037 transitions. [2019-10-03 02:55:16,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:55:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1037 transitions. [2019-10-03 02:55:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 02:55:16,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:16,188 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:16,188 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash 881915616, now seen corresponding path program 1 times [2019-10-03 02:55:16,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:55:16,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:16,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:16,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:16,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:16,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:16,389 INFO L87 Difference]: Start difference. First operand 783 states and 1037 transitions. Second operand 3 states. [2019-10-03 02:55:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:16,417 INFO L93 Difference]: Finished difference Result 786 states and 1040 transitions. [2019-10-03 02:55:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:16,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-03 02:55:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:16,424 INFO L225 Difference]: With dead ends: 786 [2019-10-03 02:55:16,424 INFO L226 Difference]: Without dead ends: 786 [2019-10-03 02:55:16,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-03 02:55:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 785. [2019-10-03 02:55:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-10-03 02:55:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1039 transitions. [2019-10-03 02:55:16,454 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1039 transitions. Word has length 239 [2019-10-03 02:55:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:16,457 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1039 transitions. [2019-10-03 02:55:16,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1039 transitions. [2019-10-03 02:55:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-03 02:55:16,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:16,465 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:16,465 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:16,466 INFO L82 PathProgramCache]: Analyzing trace with hash -159986652, now seen corresponding path program 1 times [2019-10-03 02:55:16,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 02:55:16,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:16,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:16,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:16,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:16,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:16,642 INFO L87 Difference]: Start difference. First operand 785 states and 1039 transitions. Second operand 3 states. [2019-10-03 02:55:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:16,662 INFO L93 Difference]: Finished difference Result 840 states and 1128 transitions. [2019-10-03 02:55:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:16,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-03 02:55:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:16,668 INFO L225 Difference]: With dead ends: 840 [2019-10-03 02:55:16,669 INFO L226 Difference]: Without dead ends: 840 [2019-10-03 02:55:16,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-03 02:55:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 839. [2019-10-03 02:55:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-03 02:55:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1127 transitions. [2019-10-03 02:55:16,699 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1127 transitions. Word has length 247 [2019-10-03 02:55:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:16,700 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1127 transitions. [2019-10-03 02:55:16,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1127 transitions. [2019-10-03 02:55:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-03 02:55:16,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:16,706 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:16,706 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:16,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:16,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1666613841, now seen corresponding path program 1 times [2019-10-03 02:55:16,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:55:17,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:17,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:55:17,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:17,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:55:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:55:17,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:55:17,049 INFO L87 Difference]: Start difference. First operand 839 states and 1127 transitions. Second operand 9 states. [2019-10-03 02:55:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:17,776 INFO L93 Difference]: Finished difference Result 843 states and 1133 transitions. [2019-10-03 02:55:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:55:17,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2019-10-03 02:55:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:17,784 INFO L225 Difference]: With dead ends: 843 [2019-10-03 02:55:17,785 INFO L226 Difference]: Without dead ends: 843 [2019-10-03 02:55:17,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:55:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-10-03 02:55:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2019-10-03 02:55:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-10-03 02:55:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1133 transitions. [2019-10-03 02:55:17,824 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1133 transitions. Word has length 248 [2019-10-03 02:55:17,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:17,828 INFO L475 AbstractCegarLoop]: Abstraction has 843 states and 1133 transitions. [2019-10-03 02:55:17,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:55:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1133 transitions. [2019-10-03 02:55:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-03 02:55:17,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:17,834 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:17,835 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 316090334, now seen corresponding path program 1 times [2019-10-03 02:55:17,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:17,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:17,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:17,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:17,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-03 02:55:18,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:18,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:55:18,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:18,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:55:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:55:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:55:18,217 INFO L87 Difference]: Start difference. First operand 843 states and 1133 transitions. Second operand 4 states. [2019-10-03 02:55:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:19,471 INFO L93 Difference]: Finished difference Result 1597 states and 2143 transitions. [2019-10-03 02:55:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:55:19,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-10-03 02:55:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:19,477 INFO L225 Difference]: With dead ends: 1597 [2019-10-03 02:55:19,477 INFO L226 Difference]: Without dead ends: 838 [2019-10-03 02:55:19,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:55:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-10-03 02:55:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-10-03 02:55:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-03 02:55:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2019-10-03 02:55:19,500 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 255 [2019-10-03 02:55:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:19,501 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2019-10-03 02:55:19,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:55:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2019-10-03 02:55:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-03 02:55:19,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:19,507 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:19,507 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:19,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2003629459, now seen corresponding path program 1 times [2019-10-03 02:55:19,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:19,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:19,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:19,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-03 02:55:19,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:19,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:19,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:19,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:19,668 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand 3 states. [2019-10-03 02:55:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:19,798 INFO L93 Difference]: Finished difference Result 837 states and 1113 transitions. [2019-10-03 02:55:19,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:19,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-10-03 02:55:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:19,804 INFO L225 Difference]: With dead ends: 837 [2019-10-03 02:55:19,805 INFO L226 Difference]: Without dead ends: 837 [2019-10-03 02:55:19,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-10-03 02:55:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-10-03 02:55:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-03 02:55:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1113 transitions. [2019-10-03 02:55:19,832 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1113 transitions. Word has length 273 [2019-10-03 02:55:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:19,832 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1113 transitions. [2019-10-03 02:55:19,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1113 transitions. [2019-10-03 02:55:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-03 02:55:19,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:19,840 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:19,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash -953455789, now seen corresponding path program 1 times [2019-10-03 02:55:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:19,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:19,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-03 02:55:20,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:20,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-03 02:55:20,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:20,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 02:55:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 02:55:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:55:20,440 INFO L87 Difference]: Start difference. First operand 837 states and 1113 transitions. Second operand 21 states. [2019-10-03 02:55:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:27,702 INFO L93 Difference]: Finished difference Result 2478 states and 3370 transitions. [2019-10-03 02:55:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-03 02:55:27,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 283 [2019-10-03 02:55:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:27,717 INFO L225 Difference]: With dead ends: 2478 [2019-10-03 02:55:27,717 INFO L226 Difference]: Without dead ends: 2478 [2019-10-03 02:55:27,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=505, Invalid=3785, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:55:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-03 02:55:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2441. [2019-10-03 02:55:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-10-03 02:55:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3317 transitions. [2019-10-03 02:55:27,804 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3317 transitions. Word has length 283 [2019-10-03 02:55:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:27,805 INFO L475 AbstractCegarLoop]: Abstraction has 2441 states and 3317 transitions. [2019-10-03 02:55:27,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 02:55:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3317 transitions. [2019-10-03 02:55:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-03 02:55:27,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:27,813 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:27,813 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash 782051777, now seen corresponding path program 1 times [2019-10-03 02:55:27,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:27,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:27,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:27,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:28,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:28,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-03 02:55:28,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:28,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 02:55:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 02:55:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:55:28,188 INFO L87 Difference]: Start difference. First operand 2441 states and 3317 transitions. Second operand 17 states. [2019-10-03 02:55:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:28,828 INFO L93 Difference]: Finished difference Result 2579 states and 3515 transitions. [2019-10-03 02:55:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:55:28,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 284 [2019-10-03 02:55:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:28,844 INFO L225 Difference]: With dead ends: 2579 [2019-10-03 02:55:28,844 INFO L226 Difference]: Without dead ends: 2555 [2019-10-03 02:55:28,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-03 02:55:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-10-03 02:55:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-10-03 02:55:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-10-03 02:55:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3475 transitions. [2019-10-03 02:55:28,940 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3475 transitions. Word has length 284 [2019-10-03 02:55:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:28,941 INFO L475 AbstractCegarLoop]: Abstraction has 2555 states and 3475 transitions. [2019-10-03 02:55:28,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 02:55:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3475 transitions. [2019-10-03 02:55:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-03 02:55:28,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:28,948 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:28,949 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 491512210, now seen corresponding path program 1 times [2019-10-03 02:55:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:28,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:28,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:28,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:28,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-03 02:55:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-03 02:55:29,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:29,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 02:55:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 02:55:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:55:29,385 INFO L87 Difference]: Start difference. First operand 2555 states and 3475 transitions. Second operand 17 states. [2019-10-03 02:55:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:34,629 INFO L93 Difference]: Finished difference Result 2687 states and 3677 transitions. [2019-10-03 02:55:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-03 02:55:34,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 284 [2019-10-03 02:55:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:34,645 INFO L225 Difference]: With dead ends: 2687 [2019-10-03 02:55:34,645 INFO L226 Difference]: Without dead ends: 2687 [2019-10-03 02:55:34,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:55:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-10-03 02:55:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2650. [2019-10-03 02:55:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2019-10-03 02:55:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3625 transitions. [2019-10-03 02:55:34,757 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3625 transitions. Word has length 284 [2019-10-03 02:55:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:34,758 INFO L475 AbstractCegarLoop]: Abstraction has 2650 states and 3625 transitions. [2019-10-03 02:55:34,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 02:55:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3625 transitions. [2019-10-03 02:55:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-03 02:55:34,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:34,768 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:34,768 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash 47490106, now seen corresponding path program 1 times [2019-10-03 02:55:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:34,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:34,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:34,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-03 02:55:35,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-03 02:55:35,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:35,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-03 02:55:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-03 02:55:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:55:35,234 INFO L87 Difference]: Start difference. First operand 2650 states and 3625 transitions. Second operand 22 states. [2019-10-03 02:55:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:35,892 INFO L93 Difference]: Finished difference Result 2697 states and 3675 transitions. [2019-10-03 02:55:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 02:55:35,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 284 [2019-10-03 02:55:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:35,904 INFO L225 Difference]: With dead ends: 2697 [2019-10-03 02:55:35,904 INFO L226 Difference]: Without dead ends: 2697 [2019-10-03 02:55:35,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-10-03 02:55:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-10-03 02:55:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2695. [2019-10-03 02:55:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-10-03 02:55:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3672 transitions. [2019-10-03 02:55:35,980 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3672 transitions. Word has length 284 [2019-10-03 02:55:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:35,981 INFO L475 AbstractCegarLoop]: Abstraction has 2695 states and 3672 transitions. [2019-10-03 02:55:35,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-03 02:55:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3672 transitions. [2019-10-03 02:55:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-03 02:55:35,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:35,990 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:35,990 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1061329622, now seen corresponding path program 1 times [2019-10-03 02:55:35,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:35,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:35,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:35,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:36,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:36,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:36,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:36,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:36,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:36,234 INFO L87 Difference]: Start difference. First operand 2695 states and 3672 transitions. Second operand 5 states. [2019-10-03 02:55:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:37,948 INFO L93 Difference]: Finished difference Result 5880 states and 8121 transitions. [2019-10-03 02:55:37,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:55:37,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2019-10-03 02:55:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:37,979 INFO L225 Difference]: With dead ends: 5880 [2019-10-03 02:55:37,980 INFO L226 Difference]: Without dead ends: 5880 [2019-10-03 02:55:37,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2019-10-03 02:55:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 5862. [2019-10-03 02:55:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2019-10-03 02:55:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8090 transitions. [2019-10-03 02:55:38,158 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8090 transitions. Word has length 284 [2019-10-03 02:55:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:38,159 INFO L475 AbstractCegarLoop]: Abstraction has 5862 states and 8090 transitions. [2019-10-03 02:55:38,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8090 transitions. [2019-10-03 02:55:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-03 02:55:38,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:38,174 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:38,174 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1563124105, now seen corresponding path program 1 times [2019-10-03 02:55:38,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:38,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:38,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:38,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:38,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:38,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:55:38,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:38,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:55:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:55:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:38,457 INFO L87 Difference]: Start difference. First operand 5862 states and 8090 transitions. Second operand 7 states. [2019-10-03 02:55:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:41,488 INFO L93 Difference]: Finished difference Result 15286 states and 23147 transitions. [2019-10-03 02:55:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:55:41,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2019-10-03 02:55:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:41,576 INFO L225 Difference]: With dead ends: 15286 [2019-10-03 02:55:41,576 INFO L226 Difference]: Without dead ends: 15286 [2019-10-03 02:55:41,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:55:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15286 states. [2019-10-03 02:55:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15286 to 15260. [2019-10-03 02:55:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15260 states. [2019-10-03 02:55:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15260 states to 15260 states and 22997 transitions. [2019-10-03 02:55:42,105 INFO L78 Accepts]: Start accepts. Automaton has 15260 states and 22997 transitions. Word has length 284 [2019-10-03 02:55:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:42,106 INFO L475 AbstractCegarLoop]: Abstraction has 15260 states and 22997 transitions. [2019-10-03 02:55:42,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:55:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 15260 states and 22997 transitions. [2019-10-03 02:55:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-03 02:55:42,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:42,122 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:42,122 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1291173616, now seen corresponding path program 1 times [2019-10-03 02:55:42,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:42,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:42,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:42,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-03 02:55:42,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:42,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-03 02:55:42,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-03 02:55:42,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-10-03 02:55:42,951 INFO L87 Difference]: Start difference. First operand 15260 states and 22997 transitions. Second operand 38 states. [2019-10-03 02:55:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:44,772 INFO L93 Difference]: Finished difference Result 16451 states and 24781 transitions. [2019-10-03 02:55:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-03 02:55:44,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 285 [2019-10-03 02:55:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:44,844 INFO L225 Difference]: With dead ends: 16451 [2019-10-03 02:55:44,844 INFO L226 Difference]: Without dead ends: 16451 [2019-10-03 02:55:44,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:55:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2019-10-03 02:55:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 16430. [2019-10-03 02:55:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16430 states. [2019-10-03 02:55:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 24760 transitions. [2019-10-03 02:55:45,428 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 24760 transitions. Word has length 285 [2019-10-03 02:55:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:45,429 INFO L475 AbstractCegarLoop]: Abstraction has 16430 states and 24760 transitions. [2019-10-03 02:55:45,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-03 02:55:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 24760 transitions. [2019-10-03 02:55:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-03 02:55:45,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:45,445 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:45,446 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:45,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1368716989, now seen corresponding path program 1 times [2019-10-03 02:55:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:45,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:45,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:45,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:55:45,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:45,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:55:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:55:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:55:45,817 INFO L87 Difference]: Start difference. First operand 16430 states and 24760 transitions. Second operand 19 states. [2019-10-03 02:55:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:47,450 INFO L93 Difference]: Finished difference Result 17307 states and 26864 transitions. [2019-10-03 02:55:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 02:55:47,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 294 [2019-10-03 02:55:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:47,505 INFO L225 Difference]: With dead ends: 17307 [2019-10-03 02:55:47,505 INFO L226 Difference]: Without dead ends: 17247 [2019-10-03 02:55:47,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 02:55:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17247 states. [2019-10-03 02:55:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17247 to 17247. [2019-10-03 02:55:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17247 states. [2019-10-03 02:55:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17247 states to 17247 states and 26555 transitions. [2019-10-03 02:55:48,091 INFO L78 Accepts]: Start accepts. Automaton has 17247 states and 26555 transitions. Word has length 294 [2019-10-03 02:55:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:48,091 INFO L475 AbstractCegarLoop]: Abstraction has 17247 states and 26555 transitions. [2019-10-03 02:55:48,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:55:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17247 states and 26555 transitions. [2019-10-03 02:55:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-03 02:55:48,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:48,111 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:48,112 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash -187844619, now seen corresponding path program 1 times [2019-10-03 02:55:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:48,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:48,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:48,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:48,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:49,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:49,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-03 02:55:49,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:49,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-03 02:55:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-03 02:55:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:55:49,003 INFO L87 Difference]: Start difference. First operand 17247 states and 26555 transitions. Second operand 40 states. [2019-10-03 02:55:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:51,036 INFO L93 Difference]: Finished difference Result 18838 states and 29392 transitions. [2019-10-03 02:55:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-03 02:55:51,037 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 294 [2019-10-03 02:55:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:51,116 INFO L225 Difference]: With dead ends: 18838 [2019-10-03 02:55:51,116 INFO L226 Difference]: Without dead ends: 18838 [2019-10-03 02:55:51,118 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-03 02:55:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18838 states. [2019-10-03 02:55:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18838 to 18821. [2019-10-03 02:55:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18821 states. [2019-10-03 02:55:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18821 states to 18821 states and 29278 transitions. [2019-10-03 02:55:51,807 INFO L78 Accepts]: Start accepts. Automaton has 18821 states and 29278 transitions. Word has length 294 [2019-10-03 02:55:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:51,808 INFO L475 AbstractCegarLoop]: Abstraction has 18821 states and 29278 transitions. [2019-10-03 02:55:51,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-03 02:55:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 18821 states and 29278 transitions. [2019-10-03 02:55:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-03 02:55:51,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:51,826 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:51,827 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash -46884149, now seen corresponding path program 1 times [2019-10-03 02:55:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:51,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:51,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:52,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:55:52,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:52,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:55:52,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:55:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:55:52,139 INFO L87 Difference]: Start difference. First operand 18821 states and 29278 transitions. Second operand 11 states. [2019-10-03 02:55:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:52,571 INFO L93 Difference]: Finished difference Result 19031 states and 29567 transitions. [2019-10-03 02:55:52,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:55:52,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 289 [2019-10-03 02:55:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:52,658 INFO L225 Difference]: With dead ends: 19031 [2019-10-03 02:55:52,658 INFO L226 Difference]: Without dead ends: 19031 [2019-10-03 02:55:52,659 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:55:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2019-10-03 02:55:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 19031. [2019-10-03 02:55:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19031 states. [2019-10-03 02:55:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19031 states to 19031 states and 29567 transitions. [2019-10-03 02:55:53,468 INFO L78 Accepts]: Start accepts. Automaton has 19031 states and 29567 transitions. Word has length 289 [2019-10-03 02:55:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:53,469 INFO L475 AbstractCegarLoop]: Abstraction has 19031 states and 29567 transitions. [2019-10-03 02:55:53,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:55:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 19031 states and 29567 transitions. [2019-10-03 02:55:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-03 02:55:53,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:53,484 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:53,485 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1185836743, now seen corresponding path program 1 times [2019-10-03 02:55:53,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:53,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:53,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:53,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:53,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:53,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:53,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:53,687 INFO L87 Difference]: Start difference. First operand 19031 states and 29567 transitions. Second operand 5 states. [2019-10-03 02:55:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:53,837 INFO L93 Difference]: Finished difference Result 19419 states and 30629 transitions. [2019-10-03 02:55:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:53,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-10-03 02:55:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:53,917 INFO L225 Difference]: With dead ends: 19419 [2019-10-03 02:55:53,917 INFO L226 Difference]: Without dead ends: 19419 [2019-10-03 02:55:53,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19419 states. [2019-10-03 02:55:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19419 to 19185. [2019-10-03 02:55:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19185 states. [2019-10-03 02:55:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19185 states to 19185 states and 29768 transitions. [2019-10-03 02:55:54,543 INFO L78 Accepts]: Start accepts. Automaton has 19185 states and 29768 transitions. Word has length 294 [2019-10-03 02:55:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:54,543 INFO L475 AbstractCegarLoop]: Abstraction has 19185 states and 29768 transitions. [2019-10-03 02:55:54,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 19185 states and 29768 transitions. [2019-10-03 02:55:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-03 02:55:54,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:54,553 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:54,553 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:54,554 INFO L82 PathProgramCache]: Analyzing trace with hash -385468641, now seen corresponding path program 1 times [2019-10-03 02:55:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:54,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:54,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:54,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:54,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:54,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:54,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:54,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:54,746 INFO L87 Difference]: Start difference. First operand 19185 states and 29768 transitions. Second operand 5 states. [2019-10-03 02:55:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:54,936 INFO L93 Difference]: Finished difference Result 15192 states and 23092 transitions. [2019-10-03 02:55:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:54,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 304 [2019-10-03 02:55:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:55,015 INFO L225 Difference]: With dead ends: 15192 [2019-10-03 02:55:55,015 INFO L226 Difference]: Without dead ends: 15189 [2019-10-03 02:55:55,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15189 states. [2019-10-03 02:55:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15189 to 15179. [2019-10-03 02:55:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15179 states. [2019-10-03 02:55:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15179 states to 15179 states and 23062 transitions. [2019-10-03 02:55:56,274 INFO L78 Accepts]: Start accepts. Automaton has 15179 states and 23062 transitions. Word has length 304 [2019-10-03 02:55:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:56,275 INFO L475 AbstractCegarLoop]: Abstraction has 15179 states and 23062 transitions. [2019-10-03 02:55:56,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 15179 states and 23062 transitions. [2019-10-03 02:55:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-03 02:55:56,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:56,283 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:56,283 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 168481653, now seen corresponding path program 1 times [2019-10-03 02:55:56,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:56,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:56,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:56,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:56,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-03 02:55:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:56,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:55:56,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:56,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:55:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:55:56,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:56,494 INFO L87 Difference]: Start difference. First operand 15179 states and 23062 transitions. Second operand 6 states. [2019-10-03 02:55:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:57,356 INFO L93 Difference]: Finished difference Result 30280 states and 46364 transitions. [2019-10-03 02:55:57,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:55:57,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-10-03 02:55:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:57,446 INFO L225 Difference]: With dead ends: 30280 [2019-10-03 02:55:57,447 INFO L226 Difference]: Without dead ends: 30280 [2019-10-03 02:55:57,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:55:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30280 states. [2019-10-03 02:55:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30280 to 29867. [2019-10-03 02:55:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29867 states. [2019-10-03 02:55:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29867 states to 29867 states and 45216 transitions. [2019-10-03 02:55:58,137 INFO L78 Accepts]: Start accepts. Automaton has 29867 states and 45216 transitions. Word has length 295 [2019-10-03 02:55:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:58,138 INFO L475 AbstractCegarLoop]: Abstraction has 29867 states and 45216 transitions. [2019-10-03 02:55:58,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:55:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 29867 states and 45216 transitions. [2019-10-03 02:55:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-03 02:55:58,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:58,149 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:58,150 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:58,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1832734104, now seen corresponding path program 1 times [2019-10-03 02:55:58,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:58,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-03 02:55:58,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:58,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:58,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:58,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:58,637 INFO L87 Difference]: Start difference. First operand 29867 states and 45216 transitions. Second operand 8 states. [2019-10-03 02:56:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:00,472 INFO L93 Difference]: Finished difference Result 61785 states and 94795 transitions. [2019-10-03 02:56:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:56:00,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 323 [2019-10-03 02:56:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:00,745 INFO L225 Difference]: With dead ends: 61785 [2019-10-03 02:56:00,745 INFO L226 Difference]: Without dead ends: 61785 [2019-10-03 02:56:00,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:56:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61785 states. [2019-10-03 02:56:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61785 to 61518. [2019-10-03 02:56:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61518 states. [2019-10-03 02:56:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61518 states to 61518 states and 94363 transitions. [2019-10-03 02:56:02,433 INFO L78 Accepts]: Start accepts. Automaton has 61518 states and 94363 transitions. Word has length 323 [2019-10-03 02:56:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:02,434 INFO L475 AbstractCegarLoop]: Abstraction has 61518 states and 94363 transitions. [2019-10-03 02:56:02,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:56:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 61518 states and 94363 transitions. [2019-10-03 02:56:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-03 02:56:02,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:02,461 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:56:02,461 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash -890283280, now seen corresponding path program 1 times [2019-10-03 02:56:02,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:02,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:02,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:02,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:02,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-03 02:56:02,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:56:02,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-03 02:56:02,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:02,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 02:56:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 02:56:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:56:02,828 INFO L87 Difference]: Start difference. First operand 61518 states and 94363 transitions. Second operand 17 states. [2019-10-03 02:56:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:09,257 INFO L93 Difference]: Finished difference Result 60997 states and 93058 transitions. [2019-10-03 02:56:09,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-03 02:56:09,257 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 324 [2019-10-03 02:56:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:09,512 INFO L225 Difference]: With dead ends: 60997 [2019-10-03 02:56:09,512 INFO L226 Difference]: Without dead ends: 60997 [2019-10-03 02:56:09,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 02:56:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60997 states. [2019-10-03 02:56:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60997 to 60177. [2019-10-03 02:56:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60177 states. [2019-10-03 02:56:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60177 states to 60177 states and 91282 transitions. [2019-10-03 02:56:10,846 INFO L78 Accepts]: Start accepts. Automaton has 60177 states and 91282 transitions. Word has length 324 [2019-10-03 02:56:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:10,847 INFO L475 AbstractCegarLoop]: Abstraction has 60177 states and 91282 transitions. [2019-10-03 02:56:10,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 02:56:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 60177 states and 91282 transitions. [2019-10-03 02:56:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-03 02:56:10,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:10,881 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:56:10,881 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash 92641744, now seen corresponding path program 1 times [2019-10-03 02:56:10,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:10,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:10,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:10,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:10,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-03 02:56:11,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:56:11,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:56:11,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:11,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:56:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:56:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:56:11,525 INFO L87 Difference]: Start difference. First operand 60177 states and 91282 transitions. Second operand 7 states. [2019-10-03 02:56:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:18,399 INFO L93 Difference]: Finished difference Result 122398 states and 185608 transitions. [2019-10-03 02:56:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:56:18,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 315 [2019-10-03 02:56:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:18,959 INFO L225 Difference]: With dead ends: 122398 [2019-10-03 02:56:18,959 INFO L226 Difference]: Without dead ends: 122398 [2019-10-03 02:56:18,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:56:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122398 states. [2019-10-03 02:56:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122398 to 120127. [2019-10-03 02:56:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120127 states. [2019-10-03 02:56:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120127 states to 120127 states and 181794 transitions. [2019-10-03 02:56:24,408 INFO L78 Accepts]: Start accepts. Automaton has 120127 states and 181794 transitions. Word has length 315 [2019-10-03 02:56:24,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:24,409 INFO L475 AbstractCegarLoop]: Abstraction has 120127 states and 181794 transitions. [2019-10-03 02:56:24,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:56:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 120127 states and 181794 transitions. [2019-10-03 02:56:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-03 02:56:24,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:24,477 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:56:24,477 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash -528163511, now seen corresponding path program 1 times [2019-10-03 02:56:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:24,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:24,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:24,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-03 02:56:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:56:24,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:56:24,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 325 with the following transitions: [2019-10-03 02:56:24,785 INFO L207 CegarAbsIntRunner]: [59], [62], [63], [66], [72], [86], [93], [95], [98], [101], [111], [114], [124], [132], [134], [139], [143], [159], [162], [171], [172], [175], [179], [181], [183], [185], [187], [189], [191], [193], [195], [196], [197], [200], [282], [285], [291], [318], [321], [322], [323], [326], [332], [335], [337], [354], [377], [379], [380], [383], [392], [403], [406], [408], [412], [413], [416], [426], [439], [442], [463], [501], [503], [509], [512], [521], [697], [698], [756], [759], [773], [814], [816], [819], [824], [827], [833], [836], [842], [845], [851], [854], [860], [863], [869], [872], [876], [898], [899], [900], [903], [909], [910], [912], [915], [919], [943], [947], [950], [958], [961], [965], [966], [969], [974], [977], [994], [997], [1012], [1015], [1022], [1031], [1035], [1037], [1039], [1042], [1055], [1062], [1065], [1071], [1073], [1393], [1395], [1398], [1402], [1403], [1405], [1407], [1414], [1418], [1472], [1475], [1498], [1502], [1503], [1532], [1535], [1539], [1540], [1543], [1547], [1551], [1577], [1578], [1580], [1583], [1585], [1588], [1590], [1592], [1595], [1618], [1620], [1703], [1706], [1712], [1713], [1715], [1744], [1747], [1761], [1770], [1773], [1782], [1860], [1861], [1984], [1986], [1988], [1990], [1991], [2005], [2011], [2012], [2013], [2029], [2030], [2031], [2033], [2043], [2044], [2047], [2048], [2049], [2050], [2051], [2052], [2053], [2054], [2055], [2056], [2057], [2058], [2059], [2060], [2061], [2062], [2063], [2064], [2065], [2066], [2073], [2074], [2075], [2076], [2077], [2078], [2095], [2103], [2104], [2109], [2110], [2117], [2121], [2137], [2138], [2139], [2140], [2141], [2189], [2190], [2191], [2193], [2194], [2199], [2200], [2201], [2202], [2203], [2204], [2205], [2206], [2207], [2209], [2210], [2213], [2217], [2218], [2219], [2220], [2235], [2236], [2237], [2238], [2239], [2267], [2271], [2272], [2275], [2276], [2277], [2278], [2283], [2285], [2289], [2290], [2291], [2305], [2306], [2309], [2310], [2311], [2312], [2313], [2314], [2315], [2316], [2317], [2318], [2319], [2320], [2321], [2329], [2330], [2331], [2333], [2334], [2361], [2362], [2363], [2364], [2365], [2366], [2367], [2368], [2369] [2019-10-03 02:56:24,856 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:56:24,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:56:24,986 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:56:24,989 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 205 root evaluator evaluations with a maximum evaluation depth of 0. Performed 205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 378 variables. [2019-10-03 02:56:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:24,994 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:56:25,149 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:56:25,150 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:56:25,162 INFO L420 sIntCurrentIteration]: We unified 323 AI predicates to 323 [2019-10-03 02:56:25,162 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:56:25,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:56:25,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 13 [2019-10-03 02:56:25,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:25,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:56:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:56:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:56:25,166 INFO L87 Difference]: Start difference. First operand 120127 states and 181794 transitions. Second operand 2 states. [2019-10-03 02:56:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:25,167 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:56:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:56:25,167 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 324 [2019-10-03 02:56:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:25,168 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:56:25,168 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:56:25,168 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:56:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:56:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:56:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:56:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:56:25,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2019-10-03 02:56:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:25,169 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:56:25,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:56:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:56:25,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:56:25,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:56:25 BoogieIcfgContainer [2019-10-03 02:56:25,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:56:25,180 INFO L168 Benchmark]: Toolchain (without parser) took 77947.85 ms. Allocated memory was 137.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 82.5 MB in the beginning and 1.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 952.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:56:25,181 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:56:25,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1276.98 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 82.2 MB in the beginning and 95.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:56:25,189 INFO L168 Benchmark]: Boogie Preprocessor took 191.17 ms. Allocated memory is still 200.3 MB. Free memory was 95.4 MB in the beginning and 85.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:56:25,190 INFO L168 Benchmark]: RCFGBuilder took 2692.97 ms. Allocated memory was 200.3 MB in the beginning and 271.1 MB in the end (delta: 70.8 MB). Free memory was 85.6 MB in the beginning and 96.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:56:25,191 INFO L168 Benchmark]: TraceAbstraction took 73779.84 ms. Allocated memory was 271.1 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 94.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 831.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:56:25,204 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1276.98 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 82.2 MB in the beginning and 95.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.17 ms. Allocated memory is still 200.3 MB. Free memory was 95.4 MB in the beginning and 85.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2692.97 ms. Allocated memory was 200.3 MB in the beginning and 271.1 MB in the end (delta: 70.8 MB). Free memory was 85.6 MB in the beginning and 96.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73779.84 ms. Allocated memory was 271.1 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 94.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 831.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3450]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 135 procedures, 966 locations, 1 error locations. SAFE Result, 73.6s OverallTime, 27 OverallIterations, 8 TraceHistogramMax, 47.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32549 SDtfs, 28325 SDslu, 238231 SDs, 0 SdLazy, 27932 SolverSat, 5137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120127occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.7492260061919505 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 4184 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 7299 NumberOfCodeBlocks, 7299 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 7272 ConstructedInterpolants, 0 QuantifiedInterpolants, 2672772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 3159/3162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...