java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:53:29,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:53:29,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:53:29,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:53:29,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:53:29,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:53:29,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:53:29,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:53:29,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:53:29,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:53:29,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:53:29,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:53:29,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:53:29,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:53:29,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:53:29,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:53:29,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:53:29,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:53:29,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:53:29,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:53:29,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:53:29,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:53:29,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:53:29,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:53:29,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:53:29,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:53:29,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:53:29,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:53:29,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:53:29,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:53:29,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:53:29,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:53:29,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:53:29,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:53:29,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:53:29,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:53:29,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:53:29,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:53:29,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:53:29,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:53:29,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:53:29,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:53:29,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:53:29,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:53:29,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:53:29,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:53:29,322 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:53:29,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:53:29,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:53:29,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:53:29,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:53:29,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:53:29,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:53:29,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:53:29,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:53:29,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:53:29,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:53:29,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:53:29,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:53:29,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:53:29,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:53:29,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:53:29,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:53:29,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:53:29,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:53:29,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:53:29,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:53:29,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:53:29,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:53:29,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:53:29,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:53:29,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:53:29,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:53:29,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:53:29,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:53:29,375 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:53:29,376 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-02 13:53:29,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a741b92/0f67a5783e174f48b6fa136f5ee2eaac/FLAG5801e3218 [2019-10-02 13:53:30,087 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:53:30,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c [2019-10-02 13:53:30,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a741b92/0f67a5783e174f48b6fa136f5ee2eaac/FLAG5801e3218 [2019-10-02 13:53:30,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61a741b92/0f67a5783e174f48b6fa136f5ee2eaac [2019-10-02 13:53:30,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:53:30,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:53:30,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:53:30,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:53:30,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:53:30,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:53:30" (1/1) ... [2019-10-02 13:53:30,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35299c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:30, skipping insertion in model container [2019-10-02 13:53:30,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:53:30" (1/1) ... [2019-10-02 13:53:30,308 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:53:30,402 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:53:31,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:53:31,299 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:53:31,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:53:31,656 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:53:31,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31 WrapperNode [2019-10-02 13:53:31,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:53:31,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:53:31,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:53:31,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:53:31,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... [2019-10-02 13:53:31,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:53:31,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:53:31,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:53:31,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:53:31,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:53:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:53:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:53:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:53:31,948 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:53:31,949 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-02 13:53:31,949 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-02 13:53:31,949 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-02 13:53:31,949 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-02 13:53:31,950 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-02 13:53:31,950 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-02 13:53:31,951 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:53:31,951 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:53:31,951 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-02 13:53:31,952 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-02 13:53:31,953 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-02 13:53:31,953 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-02 13:53:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-02 13:53:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-02 13:53:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-02 13:53:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-02 13:53:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:53:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:53:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:53:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:53:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:53:31,960 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:53:31,960 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:53:31,960 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:53:31,961 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:53:31,961 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:53:31,961 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:53:31,961 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:53:31,961 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:53:31,962 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:53:31,962 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:53:31,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:53:31,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:53:31,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:53:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:53:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:53:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:53:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:53:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:53:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:53:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:53:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:53:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:53:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:53:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:53:31,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:53:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:53:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:53:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:53:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:53:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:53:31,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-02 13:53:31,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-02 13:53:31,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:53:31,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-02 13:53:31,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-02 13:53:31,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:53:31,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-02 13:53:31,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-02 13:53:31,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:53:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:53:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:53:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:53:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:53:31,969 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:53:31,969 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:53:31,969 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:53:31,969 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:53:31,970 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:53:31,970 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:53:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:53:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:53:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:53:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:53:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:53:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:53:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:53:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-02 13:53:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-02 13:53:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-02 13:53:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-02 13:53:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-02 13:53:31,973 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-02 13:53:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:53:31,975 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-02 13:53:31,975 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-02 13:53:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:53:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:53:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:53:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:53:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:53:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:53:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:53:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:53:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:53:31,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:53:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:53:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:53:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:53:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:53:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:53:31,978 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:53:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:53:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:53:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:53:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:53:31,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:53:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:53:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:53:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:53:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:53:31,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:53:31,981 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:53:31,981 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:53:31,981 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:53:31,981 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:53:31,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:53:31,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:53:31,982 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:53:31,983 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:53:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:53:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:53:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:53:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:53:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:53:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:53:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:53:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:53:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:53:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:53:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:53:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:53:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:53:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:53:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:53:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:53:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:53:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:53:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:53:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:53:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:53:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:53:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:53:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:53:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:53:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:53:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:53:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:53:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:53:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:53:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:53:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:53:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:53:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:53:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:53:32,004 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:53:32,005 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:53:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:53:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:53:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:53:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:53:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:53:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:53:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:53:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:53:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:53:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:53:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:53:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:53:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:53:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:53:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:53:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-02 13:53:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-02 13:53:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-02 13:53:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-02 13:53:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-02 13:53:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-02 13:53:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-02 13:53:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-02 13:53:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-02 13:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-02 13:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-02 13:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-02 13:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-02 13:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-02 13:53:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:53:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:53:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:53:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:53:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:53:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:53:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:53:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:53:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:53:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:53:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:53:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:53:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:53:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:53:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:53:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:53:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:53:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:53:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:53:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:53:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:53:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:53:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:53:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:53:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:53:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-02 13:53:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-02 13:53:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-02 13:53:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-02 13:53:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-02 13:53:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-02 13:53:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:53:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:53:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-02 13:53:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-02 13:53:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-02 13:53:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-02 13:53:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-02 13:53:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-02 13:53:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-02 13:53:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-02 13:53:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:53:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:53:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:53:32,020 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:53:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:53:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:53:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:53:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:53:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:53:32,021 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:53:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:53:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:53:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:53:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:53:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:53:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:53:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:53:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:53:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:53:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:53:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:53:32,045 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:53:32,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:53:32,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:53:34,231 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:53:34,232 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:53:34,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:53:34 BoogieIcfgContainer [2019-10-02 13:53:34,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:53:34,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:53:34,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:53:34,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:53:34,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:53:30" (1/3) ... [2019-10-02 13:53:34,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534b719a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:53:34, skipping insertion in model container [2019-10-02 13:53:34,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:53:31" (2/3) ... [2019-10-02 13:53:34,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534b719a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:53:34, skipping insertion in model container [2019-10-02 13:53:34,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:53:34" (3/3) ... [2019-10-02 13:53:34,243 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_productSimulator.cil.c [2019-10-02 13:53:34,254 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:53:34,269 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:53:34,286 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:53:34,333 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:53:34,334 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:53:34,334 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:53:34,335 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:53:34,335 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:53:34,335 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:53:34,335 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:53:34,335 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:53:34,335 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:53:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states. [2019-10-02 13:53:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 13:53:34,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:34,422 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-02 13:53:34,426 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1981240698, now seen corresponding path program 1 times [2019-10-02 13:53:34,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:34,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:34,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:35,345 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-02 13:53:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:35,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:53:35,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:53:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:53:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:53:35,372 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 6 states. [2019-10-02 13:53:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:35,596 INFO L93 Difference]: Finished difference Result 1538 states and 2131 transitions. [2019-10-02 13:53:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:53:35,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-10-02 13:53:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:35,645 INFO L225 Difference]: With dead ends: 1538 [2019-10-02 13:53:35,646 INFO L226 Difference]: Without dead ends: 781 [2019-10-02 13:53:35,655 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-02 13:53:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-02 13:53:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2019-10-02 13:53:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-02 13:53:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1063 transitions. [2019-10-02 13:53:35,786 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1063 transitions. Word has length 190 [2019-10-02 13:53:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:35,788 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1063 transitions. [2019-10-02 13:53:35,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:53:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1063 transitions. [2019-10-02 13:53:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:53:35,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:35,802 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-02 13:53:35,802 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 109619264, now seen corresponding path program 1 times [2019-10-02 13:53:35,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:35,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:36,035 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-02 13:53:36,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:53:36,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:53:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:53:36,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:53:36,083 INFO L87 Difference]: Start difference. First operand 781 states and 1063 transitions. Second operand 4 states. [2019-10-02 13:53:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:37,029 INFO L93 Difference]: Finished difference Result 1519 states and 2091 transitions. [2019-10-02 13:53:37,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:53:37,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-10-02 13:53:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:37,042 INFO L225 Difference]: With dead ends: 1519 [2019-10-02 13:53:37,042 INFO L226 Difference]: Without dead ends: 782 [2019-10-02 13:53:37,047 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-02 13:53:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-10-02 13:53:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-10-02 13:53:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-10-02 13:53:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1058 transitions. [2019-10-02 13:53:37,129 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1058 transitions. Word has length 196 [2019-10-02 13:53:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:37,130 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1058 transitions. [2019-10-02 13:53:37,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:53:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1058 transitions. [2019-10-02 13:53:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 13:53:37,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:37,138 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-02 13:53:37,139 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash 818687885, now seen corresponding path program 1 times [2019-10-02 13:53:37,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:37,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:37,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:37,412 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-02 13:53:37,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:37,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:37,418 INFO L87 Difference]: Start difference. First operand 782 states and 1058 transitions. Second operand 3 states. [2019-10-02 13:53:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:37,557 INFO L93 Difference]: Finished difference Result 2222 states and 3067 transitions. [2019-10-02 13:53:37,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:37,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-02 13:53:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:37,572 INFO L225 Difference]: With dead ends: 2222 [2019-10-02 13:53:37,572 INFO L226 Difference]: Without dead ends: 1485 [2019-10-02 13:53:37,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-10-02 13:53:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2019-10-02 13:53:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2019-10-02 13:53:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2031 transitions. [2019-10-02 13:53:37,680 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2031 transitions. Word has length 197 [2019-10-02 13:53:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:37,681 INFO L475 AbstractCegarLoop]: Abstraction has 1482 states and 2031 transitions. [2019-10-02 13:53:37,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2031 transitions. [2019-10-02 13:53:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:53:37,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:37,689 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-02 13:53:37,689 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1701488253, now seen corresponding path program 1 times [2019-10-02 13:53:37,690 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:37,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:37,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-02 13:53:37,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:37,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:37,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:37,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:37,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:37,967 INFO L87 Difference]: Start difference. First operand 1482 states and 2031 transitions. Second operand 3 states. [2019-10-02 13:53:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:38,104 INFO L93 Difference]: Finished difference Result 1485 states and 2033 transitions. [2019-10-02 13:53:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:38,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 13:53:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:38,110 INFO L225 Difference]: With dead ends: 1485 [2019-10-02 13:53:38,110 INFO L226 Difference]: Without dead ends: 783 [2019-10-02 13:53:38,113 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-02 13:53:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2019-10-02 13:53:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-02 13:53:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1052 transitions. [2019-10-02 13:53:38,154 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1052 transitions. Word has length 198 [2019-10-02 13:53:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:38,155 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1052 transitions. [2019-10-02 13:53:38,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1052 transitions. [2019-10-02 13:53:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:53:38,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:38,160 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-02 13:53:38,160 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1151446893, now seen corresponding path program 1 times [2019-10-02 13:53:38,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:38,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:38,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:38,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:38,331 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-02 13:53:38,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:38,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:53:38,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:53:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:53:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:53:38,333 INFO L87 Difference]: Start difference. First operand 783 states and 1052 transitions. Second operand 4 states. [2019-10-02 13:53:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:39,032 INFO L93 Difference]: Finished difference Result 1503 states and 2028 transitions. [2019-10-02 13:53:39,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:53:39,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-10-02 13:53:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:39,037 INFO L225 Difference]: With dead ends: 1503 [2019-10-02 13:53:39,037 INFO L226 Difference]: Without dead ends: 789 [2019-10-02 13:53:39,039 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-02 13:53:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-02 13:53:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 783. [2019-10-02 13:53:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-02 13:53:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1037 transitions. [2019-10-02 13:53:39,074 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1037 transitions. Word has length 212 [2019-10-02 13:53:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:39,074 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1037 transitions. [2019-10-02 13:53:39,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:53:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1037 transitions. [2019-10-02 13:53:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:53:39,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:39,079 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-02 13:53:39,080 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 881915616, now seen corresponding path program 1 times [2019-10-02 13:53:39,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:39,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:39,277 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-02 13:53:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:39,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:39,279 INFO L87 Difference]: Start difference. First operand 783 states and 1037 transitions. Second operand 3 states. [2019-10-02 13:53:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:39,343 INFO L93 Difference]: Finished difference Result 1213 states and 1589 transitions. [2019-10-02 13:53:39,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:39,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-02 13:53:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:39,359 INFO L225 Difference]: With dead ends: 1213 [2019-10-02 13:53:39,360 INFO L226 Difference]: Without dead ends: 786 [2019-10-02 13:53:39,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-02 13:53:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 785. [2019-10-02 13:53:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-10-02 13:53:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1039 transitions. [2019-10-02 13:53:39,409 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1039 transitions. Word has length 239 [2019-10-02 13:53:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:39,412 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1039 transitions. [2019-10-02 13:53:39,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1039 transitions. [2019-10-02 13:53:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:53:39,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:39,420 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-02 13:53:39,420 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash -159986652, now seen corresponding path program 1 times [2019-10-02 13:53:39,421 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:39,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:39,624 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-02 13:53:39,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:39,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:39,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:39,626 INFO L87 Difference]: Start difference. First operand 785 states and 1039 transitions. Second operand 3 states. [2019-10-02 13:53:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:39,681 INFO L93 Difference]: Finished difference Result 1502 states and 2030 transitions. [2019-10-02 13:53:39,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:39,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-02 13:53:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:39,688 INFO L225 Difference]: With dead ends: 1502 [2019-10-02 13:53:39,688 INFO L226 Difference]: Without dead ends: 840 [2019-10-02 13:53:39,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-02 13:53:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 839. [2019-10-02 13:53:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-02 13:53:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1127 transitions. [2019-10-02 13:53:39,740 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1127 transitions. Word has length 247 [2019-10-02 13:53:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:39,741 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1127 transitions. [2019-10-02 13:53:39,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1127 transitions. [2019-10-02 13:53:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 13:53:39,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:39,748 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-02 13:53:39,748 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1666613841, now seen corresponding path program 1 times [2019-10-02 13:53:39,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:39,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:39,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:39,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:40,058 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-02 13:53:40,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:40,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:53:40,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:53:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:53:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:53:40,061 INFO L87 Difference]: Start difference. First operand 839 states and 1127 transitions. Second operand 9 states. [2019-10-02 13:53:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:40,363 INFO L93 Difference]: Finished difference Result 846 states and 1136 transitions. [2019-10-02 13:53:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:53:40,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2019-10-02 13:53:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:40,371 INFO L225 Difference]: With dead ends: 846 [2019-10-02 13:53:40,372 INFO L226 Difference]: Without dead ends: 843 [2019-10-02 13:53:40,373 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-02 13:53:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-10-02 13:53:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2019-10-02 13:53:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-10-02 13:53:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1133 transitions. [2019-10-02 13:53:40,429 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1133 transitions. Word has length 248 [2019-10-02 13:53:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:40,432 INFO L475 AbstractCegarLoop]: Abstraction has 843 states and 1133 transitions. [2019-10-02 13:53:40,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:53:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1133 transitions. [2019-10-02 13:53:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 13:53:40,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:40,437 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-02 13:53:40,438 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 316090334, now seen corresponding path program 1 times [2019-10-02 13:53:40,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:40,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:40,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:40,693 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-02 13:53:40,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:40,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:53:40,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:53:40,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:53:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:53:40,695 INFO L87 Difference]: Start difference. First operand 843 states and 1133 transitions. Second operand 4 states. [2019-10-02 13:53:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:41,831 INFO L93 Difference]: Finished difference Result 2393 states and 3294 transitions. [2019-10-02 13:53:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:53:41,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-10-02 13:53:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:41,837 INFO L225 Difference]: With dead ends: 2393 [2019-10-02 13:53:41,837 INFO L226 Difference]: Without dead ends: 838 [2019-10-02 13:53:41,843 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-02 13:53:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-10-02 13:53:41,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-10-02 13:53:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-02 13:53:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2019-10-02 13:53:41,882 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 255 [2019-10-02 13:53:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:41,882 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2019-10-02 13:53:41,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:53:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2019-10-02 13:53:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 13:53:41,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:41,888 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-02 13:53:41,888 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2003629459, now seen corresponding path program 1 times [2019-10-02 13:53:41,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:41,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:41,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:41,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:41,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:42,034 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-02 13:53:42,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:42,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:53:42,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:53:42,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:53:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:42,036 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand 3 states. [2019-10-02 13:53:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:42,157 INFO L93 Difference]: Finished difference Result 1625 states and 2191 transitions. [2019-10-02 13:53:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:53:42,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-10-02 13:53:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:42,162 INFO L225 Difference]: With dead ends: 1625 [2019-10-02 13:53:42,162 INFO L226 Difference]: Without dead ends: 837 [2019-10-02 13:53:42,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:53:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-10-02 13:53:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-10-02 13:53:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-02 13:53:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1113 transitions. [2019-10-02 13:53:42,205 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1113 transitions. Word has length 273 [2019-10-02 13:53:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:42,205 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1113 transitions. [2019-10-02 13:53:42,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:53:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1113 transitions. [2019-10-02 13:53:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 13:53:42,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:42,211 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-02 13:53:42,211 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash -953455789, now seen corresponding path program 1 times [2019-10-02 13:53:42,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:42,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:42,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:42,669 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-02 13:53:42,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:42,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 13:53:42,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 13:53:42,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 13:53:42,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:53:42,671 INFO L87 Difference]: Start difference. First operand 837 states and 1113 transitions. Second operand 21 states. [2019-10-02 13:53:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:48,991 INFO L93 Difference]: Finished difference Result 2887 states and 3928 transitions. [2019-10-02 13:53:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 13:53:48,992 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 283 [2019-10-02 13:53:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:49,008 INFO L225 Difference]: With dead ends: 2887 [2019-10-02 13:53:49,009 INFO L226 Difference]: Without dead ends: 2478 [2019-10-02 13:53:49,013 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-02 13:53:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-02 13:53:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2441. [2019-10-02 13:53:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-10-02 13:53:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3317 transitions. [2019-10-02 13:53:49,159 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3317 transitions. Word has length 283 [2019-10-02 13:53:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:49,160 INFO L475 AbstractCegarLoop]: Abstraction has 2441 states and 3317 transitions. [2019-10-02 13:53:49,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 13:53:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3317 transitions. [2019-10-02 13:53:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:53:49,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:49,171 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-02 13:53:49,172 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 782051777, now seen corresponding path program 1 times [2019-10-02 13:53:49,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:49,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:49,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:49,525 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-02 13:53:49,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:49,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:53:49,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:53:49,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:53:49,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:53:49,528 INFO L87 Difference]: Start difference. First operand 2441 states and 3317 transitions. Second operand 17 states. [2019-10-02 13:53:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:50,184 INFO L93 Difference]: Finished difference Result 4280 states and 5786 transitions. [2019-10-02 13:53:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:53:50,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 284 [2019-10-02 13:53:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:50,201 INFO L225 Difference]: With dead ends: 4280 [2019-10-02 13:53:50,201 INFO L226 Difference]: Without dead ends: 2555 [2019-10-02 13:53:50,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:53:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-10-02 13:53:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-10-02 13:53:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-10-02 13:53:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3475 transitions. [2019-10-02 13:53:50,353 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3475 transitions. Word has length 284 [2019-10-02 13:53:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:50,354 INFO L475 AbstractCegarLoop]: Abstraction has 2555 states and 3475 transitions. [2019-10-02 13:53:50,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:53:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3475 transitions. [2019-10-02 13:53:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:53:50,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:50,364 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-02 13:53:50,364 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 491512210, now seen corresponding path program 1 times [2019-10-02 13:53:50,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:50,831 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-02 13:53:50,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:50,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:53:50,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:53:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:53:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:53:50,834 INFO L87 Difference]: Start difference. First operand 2555 states and 3475 transitions. Second operand 17 states. [2019-10-02 13:53:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:55,726 INFO L93 Difference]: Finished difference Result 4417 states and 6017 transitions. [2019-10-02 13:53:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 13:53:55,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 284 [2019-10-02 13:53:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:55,743 INFO L225 Difference]: With dead ends: 4417 [2019-10-02 13:53:55,743 INFO L226 Difference]: Without dead ends: 2687 [2019-10-02 13:53:55,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:53:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-10-02 13:53:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2650. [2019-10-02 13:53:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2019-10-02 13:53:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3625 transitions. [2019-10-02 13:53:55,892 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3625 transitions. Word has length 284 [2019-10-02 13:53:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:55,892 INFO L475 AbstractCegarLoop]: Abstraction has 2650 states and 3625 transitions. [2019-10-02 13:53:55,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:53:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3625 transitions. [2019-10-02 13:53:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:53:55,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:55,906 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-02 13:53:55,906 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash 47490106, now seen corresponding path program 1 times [2019-10-02 13:53:55,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:55,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:56,385 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-02 13:53:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:56,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:53:56,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:53:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:53:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:53:56,387 INFO L87 Difference]: Start difference. First operand 2650 states and 3625 transitions. Second operand 22 states. [2019-10-02 13:53:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:57,029 INFO L93 Difference]: Finished difference Result 4545 states and 6164 transitions. [2019-10-02 13:53:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 13:53:57,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 284 [2019-10-02 13:53:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:57,048 INFO L225 Difference]: With dead ends: 4545 [2019-10-02 13:53:57,048 INFO L226 Difference]: Without dead ends: 2697 [2019-10-02 13:53:57,055 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-02 13:53:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-10-02 13:53:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2695. [2019-10-02 13:53:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-10-02 13:53:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3672 transitions. [2019-10-02 13:53:57,237 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3672 transitions. Word has length 284 [2019-10-02 13:53:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:57,238 INFO L475 AbstractCegarLoop]: Abstraction has 2695 states and 3672 transitions. [2019-10-02 13:53:57,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:53:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3672 transitions. [2019-10-02 13:53:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:53:57,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:57,248 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-02 13:53:57,248 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1061329622, now seen corresponding path program 1 times [2019-10-02 13:53:57,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:57,451 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-02 13:53:57,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:57,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:57,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:57,453 INFO L87 Difference]: Start difference. First operand 2695 states and 3672 transitions. Second operand 5 states. [2019-10-02 13:53:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:58,989 INFO L93 Difference]: Finished difference Result 6823 states and 9447 transitions. [2019-10-02 13:53:58,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:53:58,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2019-10-02 13:53:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:59,030 INFO L225 Difference]: With dead ends: 6823 [2019-10-02 13:53:59,030 INFO L226 Difference]: Without dead ends: 5880 [2019-10-02 13:53:59,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2019-10-02 13:53:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 5862. [2019-10-02 13:53:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2019-10-02 13:53:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8090 transitions. [2019-10-02 13:53:59,370 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8090 transitions. Word has length 284 [2019-10-02 13:53:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:59,371 INFO L475 AbstractCegarLoop]: Abstraction has 5862 states and 8090 transitions. [2019-10-02 13:53:59,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8090 transitions. [2019-10-02 13:53:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:53:59,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:59,383 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-02 13:53:59,384 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1563124105, now seen corresponding path program 1 times [2019-10-02 13:53:59,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:59,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:59,729 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-02 13:53:59,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:59,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:53:59,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:53:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:53:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:59,733 INFO L87 Difference]: Start difference. First operand 5862 states and 8090 transitions. Second operand 7 states. [2019-10-02 13:54:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:02,820 INFO L93 Difference]: Finished difference Result 19873 states and 30769 transitions. [2019-10-02 13:54:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:54:02,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2019-10-02 13:54:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:02,939 INFO L225 Difference]: With dead ends: 19873 [2019-10-02 13:54:02,940 INFO L226 Difference]: Without dead ends: 15286 [2019-10-02 13:54:02,967 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:54:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15286 states. [2019-10-02 13:54:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15286 to 15260. [2019-10-02 13:54:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15260 states. [2019-10-02 13:54:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15260 states to 15260 states and 22997 transitions. [2019-10-02 13:54:03,812 INFO L78 Accepts]: Start accepts. Automaton has 15260 states and 22997 transitions. Word has length 284 [2019-10-02 13:54:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:03,813 INFO L475 AbstractCegarLoop]: Abstraction has 15260 states and 22997 transitions. [2019-10-02 13:54:03,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:54:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15260 states and 22997 transitions. [2019-10-02 13:54:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 13:54:03,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:03,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] [2019-10-02 13:54:03,826 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1291173616, now seen corresponding path program 1 times [2019-10-02 13:54:03,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:03,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:03,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:03,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:03,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:04,625 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-02 13:54:04,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:04,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-02 13:54:04,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 13:54:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 13:54:04,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 13:54:04,628 INFO L87 Difference]: Start difference. First operand 15260 states and 22997 transitions. Second operand 38 states. [2019-10-02 13:54:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:07,311 INFO L93 Difference]: Finished difference Result 30346 states and 46106 transitions. [2019-10-02 13:54:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:54:07,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 285 [2019-10-02 13:54:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:07,394 INFO L225 Difference]: With dead ends: 30346 [2019-10-02 13:54:07,394 INFO L226 Difference]: Without dead ends: 16451 [2019-10-02 13:54:07,449 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:54:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2019-10-02 13:54:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 16430. [2019-10-02 13:54:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16430 states. [2019-10-02 13:54:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 24760 transitions. [2019-10-02 13:54:08,606 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 24760 transitions. Word has length 285 [2019-10-02 13:54:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:08,607 INFO L475 AbstractCegarLoop]: Abstraction has 16430 states and 24760 transitions. [2019-10-02 13:54:08,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 13:54:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 24760 transitions. [2019-10-02 13:54:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:54:08,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:08,625 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-02 13:54:08,626 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1368716989, now seen corresponding path program 1 times [2019-10-02 13:54:08,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:08,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:09,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-02 13:54:09,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:09,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:54:09,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:54:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:54:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:54:09,003 INFO L87 Difference]: Start difference. First operand 16430 states and 24760 transitions. Second operand 19 states. [2019-10-02 13:54:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:10,169 INFO L93 Difference]: Finished difference Result 31052 states and 48029 transitions. [2019-10-02 13:54:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 13:54:10,170 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 294 [2019-10-02 13:54:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:10,272 INFO L225 Difference]: With dead ends: 31052 [2019-10-02 13:54:10,272 INFO L226 Difference]: Without dead ends: 17247 [2019-10-02 13:54:10,320 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-02 13:54:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17247 states. [2019-10-02 13:54:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17247 to 17247. [2019-10-02 13:54:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17247 states. [2019-10-02 13:54:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17247 states to 17247 states and 26555 transitions. [2019-10-02 13:54:12,098 INFO L78 Accepts]: Start accepts. Automaton has 17247 states and 26555 transitions. Word has length 294 [2019-10-02 13:54:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:12,099 INFO L475 AbstractCegarLoop]: Abstraction has 17247 states and 26555 transitions. [2019-10-02 13:54:12,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:54:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17247 states and 26555 transitions. [2019-10-02 13:54:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:54:12,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:12,113 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-02 13:54:12,113 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:12,114 INFO L82 PathProgramCache]: Analyzing trace with hash -187844619, now seen corresponding path program 1 times [2019-10-02 13:54:12,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:12,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:12,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:12,963 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-02 13:54:12,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:12,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-02 13:54:12,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 13:54:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 13:54:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:54:12,965 INFO L87 Difference]: Start difference. First operand 17247 states and 26555 transitions. Second operand 40 states. [2019-10-02 13:54:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:15,436 INFO L93 Difference]: Finished difference Result 33322 states and 53941 transitions. [2019-10-02 13:54:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 13:54:15,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 294 [2019-10-02 13:54:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:15,513 INFO L225 Difference]: With dead ends: 33322 [2019-10-02 13:54:15,513 INFO L226 Difference]: Without dead ends: 18838 [2019-10-02 13:54:15,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 13:54:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18838 states. [2019-10-02 13:54:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18838 to 18821. [2019-10-02 13:54:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18821 states. [2019-10-02 13:54:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18821 states to 18821 states and 29278 transitions. [2019-10-02 13:54:16,985 INFO L78 Accepts]: Start accepts. Automaton has 18821 states and 29278 transitions. Word has length 294 [2019-10-02 13:54:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:16,986 INFO L475 AbstractCegarLoop]: Abstraction has 18821 states and 29278 transitions. [2019-10-02 13:54:16,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 13:54:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18821 states and 29278 transitions. [2019-10-02 13:54:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:54:17,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:17,006 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, 1, 1, 1, 1] [2019-10-02 13:54:17,006 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1766946480, now seen corresponding path program 1 times [2019-10-02 13:54:17,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:17,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:17,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:17,253 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-02 13:54:17,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:17,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:54:17,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:54:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:54:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:54:17,255 INFO L87 Difference]: Start difference. First operand 18821 states and 29278 transitions. Second operand 11 states. [2019-10-02 13:54:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:18,252 INFO L93 Difference]: Finished difference Result 19034 states and 29618 transitions. [2019-10-02 13:54:18,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:54:18,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-10-02 13:54:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:18,342 INFO L225 Difference]: With dead ends: 19034 [2019-10-02 13:54:18,342 INFO L226 Difference]: Without dead ends: 19031 [2019-10-02 13:54:18,355 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-02 13:54:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2019-10-02 13:54:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 19031. [2019-10-02 13:54:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19031 states. [2019-10-02 13:54:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19031 states to 19031 states and 29567 transitions. [2019-10-02 13:54:20,221 INFO L78 Accepts]: Start accepts. Automaton has 19031 states and 29567 transitions. Word has length 298 [2019-10-02 13:54:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:20,222 INFO L475 AbstractCegarLoop]: Abstraction has 19031 states and 29567 transitions. [2019-10-02 13:54:20,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:54:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 19031 states and 29567 transitions. [2019-10-02 13:54:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:54:20,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:20,237 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-02 13:54:20,237 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1185836743, now seen corresponding path program 1 times [2019-10-02 13:54:20,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:20,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:20,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:20,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:20,415 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-02 13:54:20,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:20,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:54:20,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:54:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:54:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:54:20,418 INFO L87 Difference]: Start difference. First operand 19031 states and 29567 transitions. Second operand 5 states. [2019-10-02 13:54:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:20,933 INFO L93 Difference]: Finished difference Result 36497 states and 57626 transitions. [2019-10-02 13:54:20,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:54:20,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-10-02 13:54:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:21,033 INFO L225 Difference]: With dead ends: 36497 [2019-10-02 13:54:21,034 INFO L226 Difference]: Without dead ends: 19419 [2019-10-02 13:54:21,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:54:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19419 states. [2019-10-02 13:54:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19419 to 19185. [2019-10-02 13:54:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19185 states. [2019-10-02 13:54:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19185 states to 19185 states and 29768 transitions. [2019-10-02 13:54:21,971 INFO L78 Accepts]: Start accepts. Automaton has 19185 states and 29768 transitions. Word has length 294 [2019-10-02 13:54:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:21,972 INFO L475 AbstractCegarLoop]: Abstraction has 19185 states and 29768 transitions. [2019-10-02 13:54:21,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:54:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 19185 states and 29768 transitions. [2019-10-02 13:54:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:54:22,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:22,150 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] [2019-10-02 13:54:22,150 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:22,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1993457705, now seen corresponding path program 1 times [2019-10-02 13:54:22,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:22,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:22,372 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-02 13:54:22,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:22,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:54:22,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:54:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:54:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:54:22,375 INFO L87 Difference]: Start difference. First operand 19185 states and 29768 transitions. Second operand 6 states. [2019-10-02 13:54:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:24,110 INFO L93 Difference]: Finished difference Result 55667 states and 87353 transitions. [2019-10-02 13:54:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:54:24,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 303 [2019-10-02 13:54:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:24,259 INFO L225 Difference]: With dead ends: 55667 [2019-10-02 13:54:24,259 INFO L226 Difference]: Without dead ends: 38287 [2019-10-02 13:54:24,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:54:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38287 states. [2019-10-02 13:54:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38287 to 37776. [2019-10-02 13:54:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37776 states. [2019-10-02 13:54:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37776 states to 37776 states and 58355 transitions. [2019-10-02 13:54:26,217 INFO L78 Accepts]: Start accepts. Automaton has 37776 states and 58355 transitions. Word has length 303 [2019-10-02 13:54:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:26,217 INFO L475 AbstractCegarLoop]: Abstraction has 37776 states and 58355 transitions. [2019-10-02 13:54:26,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:54:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 37776 states and 58355 transitions. [2019-10-02 13:54:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 13:54:26,238 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:26,239 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] [2019-10-02 13:54:26,239 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1687729027, now seen corresponding path program 1 times [2019-10-02 13:54:26,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:26,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:26,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:26,458 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-02 13:54:26,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:26,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:54:26,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:54:26,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:54:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:54:26,460 INFO L87 Difference]: Start difference. First operand 37776 states and 58355 transitions. Second operand 8 states. [2019-10-02 13:54:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:31,828 INFO L93 Difference]: Finished difference Result 114215 states and 185361 transitions. [2019-10-02 13:54:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:54:31,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 314 [2019-10-02 13:54:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:32,167 INFO L225 Difference]: With dead ends: 114215 [2019-10-02 13:54:32,167 INFO L226 Difference]: Without dead ends: 78467 [2019-10-02 13:54:32,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:54:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78467 states. [2019-10-02 13:54:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78467 to 78128. [2019-10-02 13:54:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78128 states. [2019-10-02 13:54:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78128 states to 78128 states and 122657 transitions. [2019-10-02 13:54:35,403 INFO L78 Accepts]: Start accepts. Automaton has 78128 states and 122657 transitions. Word has length 314 [2019-10-02 13:54:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:35,404 INFO L475 AbstractCegarLoop]: Abstraction has 78128 states and 122657 transitions. [2019-10-02 13:54:35,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:54:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 78128 states and 122657 transitions. [2019-10-02 13:54:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 13:54:35,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:35,479 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-02 13:54:35,479 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:35,480 INFO L82 PathProgramCache]: Analyzing trace with hash -890283280, now seen corresponding path program 1 times [2019-10-02 13:54:35,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:35,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:35,792 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-02 13:54:35,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:35,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:54:35,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:54:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:54:35,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:54:35,795 INFO L87 Difference]: Start difference. First operand 78128 states and 122657 transitions. Second operand 17 states. [2019-10-02 13:54:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:43,343 INFO L93 Difference]: Finished difference Result 147351 states and 238312 transitions. [2019-10-02 13:54:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 13:54:43,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 324 [2019-10-02 13:54:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:43,812 INFO L225 Difference]: With dead ends: 147351 [2019-10-02 13:54:43,813 INFO L226 Difference]: Without dead ends: 76828 [2019-10-02 13:54:44,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:54:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76828 states. [2019-10-02 13:54:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76828 to 75883. [2019-10-02 13:54:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75883 states. [2019-10-02 13:54:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75883 states to 75883 states and 117363 transitions. [2019-10-02 13:54:50,449 INFO L78 Accepts]: Start accepts. Automaton has 75883 states and 117363 transitions. Word has length 324 [2019-10-02 13:54:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:50,450 INFO L475 AbstractCegarLoop]: Abstraction has 75883 states and 117363 transitions. [2019-10-02 13:54:50,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:54:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 75883 states and 117363 transitions. [2019-10-02 13:54:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 13:54:50,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:50,494 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-02 13:54:50,494 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1852816405, now seen corresponding path program 1 times [2019-10-02 13:54:50,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:50,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:50,730 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-02 13:54:50,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:50,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:54:50,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:54:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:54:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:54:50,732 INFO L87 Difference]: Start difference. First operand 75883 states and 117363 transitions. Second operand 7 states. [2019-10-02 13:55:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:03,722 INFO L93 Difference]: Finished difference Result 222993 states and 353838 transitions. [2019-10-02 13:55:03,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:55:03,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2019-10-02 13:55:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:04,482 INFO L225 Difference]: With dead ends: 222993 [2019-10-02 13:55:04,482 INFO L226 Difference]: Without dead ends: 153679 [2019-10-02 13:55:04,655 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-02 13:55:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153679 states. [2019-10-02 13:55:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153679 to 151200. [2019-10-02 13:55:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151200 states. [2019-10-02 13:55:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151200 states to 151200 states and 232953 transitions. [2019-10-02 13:55:15,678 INFO L78 Accepts]: Start accepts. Automaton has 151200 states and 232953 transitions. Word has length 324 [2019-10-02 13:55:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:15,679 INFO L475 AbstractCegarLoop]: Abstraction has 151200 states and 232953 transitions. [2019-10-02 13:55:15,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:55:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 151200 states and 232953 transitions. [2019-10-02 13:55:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 13:55:15,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:15,762 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-02 13:55:15,762 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -528163511, now seen corresponding path program 2 times [2019-10-02 13:55:15,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:15,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:15,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:15,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:16,034 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-02 13:55:16,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:16,035 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:16,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:55:17,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:55:17,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:55:17,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 3822 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:55:17,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:55:18,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:18,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2019-10-02 13:55:18,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:55:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:55:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:55:18,209 INFO L87 Difference]: Start difference. First operand 151200 states and 232953 transitions. Second operand 22 states. [2019-10-02 13:55:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:27,641 INFO L93 Difference]: Finished difference Result 303108 states and 467701 transitions. [2019-10-02 13:55:27,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 13:55:27,642 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 324 [2019-10-02 13:55:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:28,506 INFO L225 Difference]: With dead ends: 303108 [2019-10-02 13:55:28,507 INFO L226 Difference]: Without dead ends: 152024 [2019-10-02 13:55:28,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:55:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152024 states. [2019-10-02 13:55:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152024 to 151558. [2019-10-02 13:55:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151558 states. [2019-10-02 13:55:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151558 states to 151558 states and 233437 transitions. [2019-10-02 13:55:43,719 INFO L78 Accepts]: Start accepts. Automaton has 151558 states and 233437 transitions. Word has length 324 [2019-10-02 13:55:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:43,720 INFO L475 AbstractCegarLoop]: Abstraction has 151558 states and 233437 transitions. [2019-10-02 13:55:43,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:55:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 151558 states and 233437 transitions. [2019-10-02 13:55:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 13:55:43,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:43,898 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:43,898 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:43,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1800084952, now seen corresponding path program 1 times [2019-10-02 13:55:43,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:43,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:43,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:55:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:44,169 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-02 13:55:44,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:44,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:55:44,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:55:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:55:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:55:44,171 INFO L87 Difference]: Start difference. First operand 151558 states and 233437 transitions. Second operand 7 states. [2019-10-02 13:56:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:05,000 INFO L93 Difference]: Finished difference Result 442144 states and 695151 transitions. [2019-10-02 13:56:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:56:05,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 326 [2019-10-02 13:56:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:06,296 INFO L225 Difference]: With dead ends: 442144 [2019-10-02 13:56:06,296 INFO L226 Difference]: Without dead ends: 304617 [2019-10-02 13:56:06,624 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-02 13:56:06,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304617 states. [2019-10-02 13:56:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304617 to 299154. [2019-10-02 13:56:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299154 states. [2019-10-02 13:56:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299154 states to 299154 states and 457782 transitions. [2019-10-02 13:56:28,470 INFO L78 Accepts]: Start accepts. Automaton has 299154 states and 457782 transitions. Word has length 326 [2019-10-02 13:56:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:28,471 INFO L475 AbstractCegarLoop]: Abstraction has 299154 states and 457782 transitions. [2019-10-02 13:56:28,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:56:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 299154 states and 457782 transitions. [2019-10-02 13:56:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-02 13:56:28,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:56:28,624 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:56:28,624 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:56:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:56:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash -637166982, now seen corresponding path program 1 times [2019-10-02 13:56:28,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:56:28,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:56:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:28,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 13:56:28,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:56:28,837 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:56:30,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:30,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 3742 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:56:30,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:56:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-02 13:56:31,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:56:31,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 13:56:31,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:56:31,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:56:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:56:31,127 INFO L87 Difference]: Start difference. First operand 299154 states and 457782 transitions. Second operand 13 states. [2019-10-02 13:57:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:00,099 INFO L93 Difference]: Finished difference Result 673002 states and 1040818 transitions. [2019-10-02 13:57:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:57:00,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 317 [2019-10-02 13:57:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:01,664 INFO L225 Difference]: With dead ends: 673002 [2019-10-02 13:57:01,665 INFO L226 Difference]: Without dead ends: 381929 [2019-10-02 13:57:02,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:57:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381929 states. [2019-10-02 13:57:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381929 to 375079. [2019-10-02 13:57:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375079 states. [2019-10-02 13:57:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375079 states to 375079 states and 557121 transitions. [2019-10-02 13:57:31,775 INFO L78 Accepts]: Start accepts. Automaton has 375079 states and 557121 transitions. Word has length 317 [2019-10-02 13:57:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:31,775 INFO L475 AbstractCegarLoop]: Abstraction has 375079 states and 557121 transitions. [2019-10-02 13:57:31,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:57:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 375079 states and 557121 transitions. [2019-10-02 13:57:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 13:57:40,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:40,245 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:40,245 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash 932800510, now seen corresponding path program 1 times [2019-10-02 13:57:40,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:40,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:40,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:57:40,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:40,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:57:40,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:57:40,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:57:40,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:57:40,452 INFO L87 Difference]: Start difference. First operand 375079 states and 557121 transitions. Second operand 3 states. [2019-10-02 13:57:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:55,804 INFO L93 Difference]: Finished difference Result 754745 states and 1123389 transitions. [2019-10-02 13:57:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:57:55,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-10-02 13:57:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:05,669 INFO L225 Difference]: With dead ends: 754745 [2019-10-02 13:58:05,669 INFO L226 Difference]: Without dead ends: 380119 [2019-10-02 13:58:06,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380119 states. [2019-10-02 13:58:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380119 to 380071. [2019-10-02 13:58:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380071 states. [2019-10-02 13:58:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380071 states to 380071 states and 566673 transitions. [2019-10-02 13:58:38,062 INFO L78 Accepts]: Start accepts. Automaton has 380071 states and 566673 transitions. Word has length 333 [2019-10-02 13:58:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:38,063 INFO L475 AbstractCegarLoop]: Abstraction has 380071 states and 566673 transitions. [2019-10-02 13:58:38,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 380071 states and 566673 transitions. [2019-10-02 13:58:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 13:58:38,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:38,236 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:38,236 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:38,236 INFO L82 PathProgramCache]: Analyzing trace with hash 804509227, now seen corresponding path program 1 times [2019-10-02 13:58:38,236 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:38,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:38,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:38,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:58:38,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:38,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:38,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:38,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:38,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:38,383 INFO L87 Difference]: Start difference. First operand 380071 states and 566673 transitions. Second operand 3 states. [2019-10-02 13:59:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:02,918 INFO L93 Difference]: Finished difference Result 769337 states and 1151181 transitions. [2019-10-02 13:59:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:59:02,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-10-02 13:59:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:04,504 INFO L225 Difference]: With dead ends: 769337 [2019-10-02 13:59:04,504 INFO L226 Difference]: Without dead ends: 389719 [2019-10-02 13:59:06,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:59:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389719 states. [2019-10-02 13:59:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389719 to 389671. [2019-10-02 13:59:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389671 states. [2019-10-02 13:59:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389671 states to 389671 states and 584817 transitions. [2019-10-02 13:59:39,150 INFO L78 Accepts]: Start accepts. Automaton has 389671 states and 584817 transitions. Word has length 334 [2019-10-02 13:59:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:39,151 INFO L475 AbstractCegarLoop]: Abstraction has 389671 states and 584817 transitions. [2019-10-02 13:59:39,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:59:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 389671 states and 584817 transitions. [2019-10-02 13:59:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 13:59:39,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:39,367 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:39,367 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash -239696017, now seen corresponding path program 1 times [2019-10-02 13:59:39,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:39,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:59:39,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:39,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:59:39,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:59:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:59:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:59:39,625 INFO L87 Difference]: Start difference. First operand 389671 states and 584817 transitions. Second operand 8 states. [2019-10-02 14:00:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:35,430 INFO L93 Difference]: Finished difference Result 1174059 states and 1784361 transitions. [2019-10-02 14:00:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:00:35,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 326 [2019-10-02 14:00:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:39,340 INFO L225 Difference]: With dead ends: 1174059 [2019-10-02 14:00:39,341 INFO L226 Difference]: Without dead ends: 784841 [2019-10-02 14:00:40,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:00:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784841 states. [2019-10-02 14:01:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784841 to 572331. [2019-10-02 14:01:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572331 states. [2019-10-02 14:01:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572331 states to 572331 states and 867883 transitions. [2019-10-02 14:01:48,773 INFO L78 Accepts]: Start accepts. Automaton has 572331 states and 867883 transitions. Word has length 326 [2019-10-02 14:01:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:48,773 INFO L475 AbstractCegarLoop]: Abstraction has 572331 states and 867883 transitions. [2019-10-02 14:01:48,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:01:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 572331 states and 867883 transitions. [2019-10-02 14:01:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 14:01:49,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:49,267 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:49,267 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1692064439, now seen corresponding path program 1 times [2019-10-02 14:01:49,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:49,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:49,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 14:01:49,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:49,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:01:49,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:01:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:01:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:01:49,490 INFO L87 Difference]: Start difference. First operand 572331 states and 867883 transitions. Second operand 8 states. [2019-10-02 14:03:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:03:11,940 INFO L93 Difference]: Finished difference Result 1728471 states and 2665911 transitions. [2019-10-02 14:03:11,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:03:11,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 335 [2019-10-02 14:03:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:03:18,110 INFO L225 Difference]: With dead ends: 1728471 [2019-10-02 14:03:18,110 INFO L226 Difference]: Without dead ends: 1156593 [2019-10-02 14:03:19,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:03:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156593 states.