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_spec0_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:41:23,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:41:23,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:41:23,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:41:23,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:41:23,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:41:23,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:41:23,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:41:23,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:41:23,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:41:23,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:41:23,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:41:23,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:41:23,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:41:23,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:41:23,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:41:23,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:41:23,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:41:23,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:41:23,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:41:24,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:41:24,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:41:24,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:41:24,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:41:24,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:41:24,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:41:24,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:41:24,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:41:24,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:41:24,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:41:24,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:41:24,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:41:24,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:41:24,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:41:24,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:41:24,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:41:24,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:41:24,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:41:24,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:41:24,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:41:24,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:41:24,015 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 12:41:24,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:41:24,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:41:24,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:41:24,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:41:24,032 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:41:24,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:41:24,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:41:24,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:41:24,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:41:24,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:41:24,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:41:24,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:41:24,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:41:24,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:41:24,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:41:24,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:41:24,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:41:24,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:41:24,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:41:24,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:41:24,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:41:24,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:41:24,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:41:24,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:41:24,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:41:24,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:41:24,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:41:24,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:41:24,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:41:24,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:41:24,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:41:24,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:41:24,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:41:24,088 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:41:24,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-10-02 12:41:24,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26a8cb61/d3b4ae756d7a446aa2f04674efdd2cb1/FLAG383e1d319 [2019-10-02 12:41:24,692 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:41:24,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product21.cil.c [2019-10-02 12:41:24,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26a8cb61/d3b4ae756d7a446aa2f04674efdd2cb1/FLAG383e1d319 [2019-10-02 12:41:24,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26a8cb61/d3b4ae756d7a446aa2f04674efdd2cb1 [2019-10-02 12:41:24,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:41:24,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:41:24,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:41:24,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:41:24,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:41:24,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:41:24" (1/1) ... [2019-10-02 12:41:24,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50821800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:24, skipping insertion in model container [2019-10-02 12:41:24,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:41:24" (1/1) ... [2019-10-02 12:41:24,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:41:25,079 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:41:25,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:41:25,929 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:41:26,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:41:26,152 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:41:26,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26 WrapperNode [2019-10-02 12:41:26,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:41:26,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:41:26,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:41:26,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:41:26,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (1/1) ... [2019-10-02 12:41:26,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:41:26,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:41:26,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:41:26,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:41:26,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (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 12:41:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:41:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:41:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:41:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:41:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:41:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:41:26,408 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:41:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:41:26,409 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:41:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:41:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:41:26,410 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:41:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:41:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:41:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:41:26,412 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:41:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:41:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:41:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:41:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:41:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:41:26,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:41:26,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:41:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:41:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:41:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:41:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:41:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:41:26,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:41:26,418 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:41:26,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:41:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:41:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:41:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:41:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:41:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:41:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:41:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:41:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:41:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:41:26,422 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:41:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:41:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:41:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:41:26,423 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:41:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:41:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:41:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:41:26,424 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:41:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:41:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:41:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:41:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:41:26,425 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:41:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:41:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:41:26,426 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:41:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 12:41:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:41:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:41:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:41:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:41:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:41:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:41:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:41:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:41:26,429 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:41:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:41:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:41:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:41:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:41:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:41:26,430 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:41:26,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:41:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:41:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:41:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:41:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:41:26,431 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:41:26,432 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:41:26,432 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:41:26,432 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:41:26,432 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:41:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:41:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:41:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:41:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:41:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:41:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:41:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:41:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:41:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:41:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:41:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:41:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:41:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:41:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:41:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:41:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:41:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:41:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:41:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:41:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:41:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:41:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:41:26,443 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:41:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:41:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:41:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:41:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:41:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:41:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:41:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:41:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 12:41:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:41:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:41:28,393 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:41:28,393 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:41:28,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:41:28 BoogieIcfgContainer [2019-10-02 12:41:28,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:41:28,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:41:28,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:41:28,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:41:28,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:41:24" (1/3) ... [2019-10-02 12:41:28,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4963211d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:41:28, skipping insertion in model container [2019-10-02 12:41:28,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:41:26" (2/3) ... [2019-10-02 12:41:28,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4963211d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:41:28, skipping insertion in model container [2019-10-02 12:41:28,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:41:28" (3/3) ... [2019-10-02 12:41:28,403 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product21.cil.c [2019-10-02 12:41:28,413 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:41:28,428 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:41:28,443 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:41:28,471 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:41:28,472 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:41:28,472 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:41:28,472 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:41:28,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:41:28,472 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:41:28,472 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:41:28,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:41:28,472 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:41:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states. [2019-10-02 12:41:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:41:28,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:28,538 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:28,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2004789445, now seen corresponding path program 1 times [2019-10-02 12:41:28,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:28,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:28,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:28,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:29,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:29,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:41:29,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:41:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:41:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:41:29,241 INFO L87 Difference]: Start difference. First operand 566 states. Second operand 2 states. [2019-10-02 12:41:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:29,333 INFO L93 Difference]: Finished difference Result 818 states and 1111 transitions. [2019-10-02 12:41:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:41:29,334 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 198 [2019-10-02 12:41:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:29,357 INFO L225 Difference]: With dead ends: 818 [2019-10-02 12:41:29,357 INFO L226 Difference]: Without dead ends: 537 [2019-10-02 12:41:29,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:41:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-02 12:41:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-10-02 12:41:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-02 12:41:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 733 transitions. [2019-10-02 12:41:29,480 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 733 transitions. Word has length 198 [2019-10-02 12:41:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:29,484 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 733 transitions. [2019-10-02 12:41:29,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:41:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 733 transitions. [2019-10-02 12:41:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:41:29,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:29,500 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:29,500 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash -24862393, now seen corresponding path program 1 times [2019-10-02 12:41:29,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:29,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:29,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:29,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:29,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:29,827 INFO L87 Difference]: Start difference. First operand 537 states and 733 transitions. Second operand 3 states. [2019-10-02 12:41:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:29,881 INFO L93 Difference]: Finished difference Result 801 states and 1074 transitions. [2019-10-02 12:41:29,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:29,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-02 12:41:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:29,889 INFO L225 Difference]: With dead ends: 801 [2019-10-02 12:41:29,889 INFO L226 Difference]: Without dead ends: 540 [2019-10-02 12:41:29,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-02 12:41:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2019-10-02 12:41:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-10-02 12:41:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 735 transitions. [2019-10-02 12:41:29,926 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 735 transitions. Word has length 199 [2019-10-02 12:41:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:29,926 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 735 transitions. [2019-10-02 12:41:29,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 735 transitions. [2019-10-02 12:41:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:41:29,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:29,932 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:29,932 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash 712401851, now seen corresponding path program 1 times [2019-10-02 12:41:29,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:29,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:29,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:30,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:30,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:30,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:30,169 INFO L87 Difference]: Start difference. First operand 539 states and 735 transitions. Second operand 3 states. [2019-10-02 12:41:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:30,231 INFO L93 Difference]: Finished difference Result 1056 states and 1471 transitions. [2019-10-02 12:41:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:30,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 12:41:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:30,243 INFO L225 Difference]: With dead ends: 1056 [2019-10-02 12:41:30,243 INFO L226 Difference]: Without dead ends: 582 [2019-10-02 12:41:30,246 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 12:41:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-02 12:41:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 581. [2019-10-02 12:41:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 12:41:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 807 transitions. [2019-10-02 12:41:30,306 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 807 transitions. Word has length 205 [2019-10-02 12:41:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:30,307 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 807 transitions. [2019-10-02 12:41:30,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 807 transitions. [2019-10-02 12:41:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:41:30,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:30,319 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:30,319 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:30,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2088954863, now seen corresponding path program 1 times [2019-10-02 12:41:30,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:30,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:30,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:30,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:30,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:41:30,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:41:30,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:41:30,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:41:30,907 INFO L87 Difference]: Start difference. First operand 581 states and 807 transitions. Second operand 19 states. [2019-10-02 12:41:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:35,986 INFO L93 Difference]: Finished difference Result 1939 states and 2714 transitions. [2019-10-02 12:41:35,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:41:35,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2019-10-02 12:41:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:36,004 INFO L225 Difference]: With dead ends: 1939 [2019-10-02 12:41:36,005 INFO L226 Difference]: Without dead ends: 1691 [2019-10-02 12:41:36,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:41:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-10-02 12:41:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1654. [2019-10-02 12:41:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-10-02 12:41:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2323 transitions. [2019-10-02 12:41:36,116 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2323 transitions. Word has length 206 [2019-10-02 12:41:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:36,117 INFO L475 AbstractCegarLoop]: Abstraction has 1654 states and 2323 transitions. [2019-10-02 12:41:36,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:41:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2323 transitions. [2019-10-02 12:41:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:41:36,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:36,125 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:36,126 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 392350703, now seen corresponding path program 1 times [2019-10-02 12:41:36,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:36,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:36,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:36,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:41:36,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:41:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:41:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:41:36,453 INFO L87 Difference]: Start difference. First operand 1654 states and 2323 transitions. Second operand 15 states. [2019-10-02 12:41:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:40,308 INFO L93 Difference]: Finished difference Result 2799 states and 3918 transitions. [2019-10-02 12:41:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:41:40,309 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2019-10-02 12:41:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:40,322 INFO L225 Difference]: With dead ends: 2799 [2019-10-02 12:41:40,322 INFO L226 Difference]: Without dead ends: 1756 [2019-10-02 12:41:40,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:41:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-10-02 12:41:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1724. [2019-10-02 12:41:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-10-02 12:41:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2438 transitions. [2019-10-02 12:41:40,447 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2438 transitions. Word has length 207 [2019-10-02 12:41:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:40,448 INFO L475 AbstractCegarLoop]: Abstraction has 1724 states and 2438 transitions. [2019-10-02 12:41:40,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:41:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2438 transitions. [2019-10-02 12:41:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:41:40,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:40,514 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:40,514 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:40,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1947422725, now seen corresponding path program 1 times [2019-10-02 12:41:40,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:40,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:41:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 12:41:40,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:41:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:41:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:41:40,802 INFO L87 Difference]: Start difference. First operand 1724 states and 2438 transitions. Second operand 16 states. [2019-10-02 12:41:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:41,281 INFO L93 Difference]: Finished difference Result 3015 states and 4281 transitions. [2019-10-02 12:41:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:41:41,281 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 207 [2019-10-02 12:41:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:41,293 INFO L225 Difference]: With dead ends: 3015 [2019-10-02 12:41:41,293 INFO L226 Difference]: Without dead ends: 1894 [2019-10-02 12:41:41,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:41:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-10-02 12:41:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2019-10-02 12:41:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-10-02 12:41:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2689 transitions. [2019-10-02 12:41:41,392 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2689 transitions. Word has length 207 [2019-10-02 12:41:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:41,392 INFO L475 AbstractCegarLoop]: Abstraction has 1894 states and 2689 transitions. [2019-10-02 12:41:41,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:41:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2689 transitions. [2019-10-02 12:41:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:41:41,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:41,401 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:41,401 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1263804375, now seen corresponding path program 1 times [2019-10-02 12:41:41,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:41,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:41,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:41,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:41,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:41,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:41:41,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:41:41,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:41:41,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:41:41,563 INFO L87 Difference]: Start difference. First operand 1894 states and 2689 transitions. Second operand 5 states. [2019-10-02 12:41:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:42,676 INFO L93 Difference]: Finished difference Result 4686 states and 6611 transitions. [2019-10-02 12:41:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:41:42,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-10-02 12:41:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:42,703 INFO L225 Difference]: With dead ends: 4686 [2019-10-02 12:41:42,704 INFO L226 Difference]: Without dead ends: 4065 [2019-10-02 12:41:42,709 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 12:41:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2019-10-02 12:41:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 4047. [2019-10-02 12:41:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2019-10-02 12:41:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5732 transitions. [2019-10-02 12:41:42,939 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5732 transitions. Word has length 207 [2019-10-02 12:41:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:42,943 INFO L475 AbstractCegarLoop]: Abstraction has 4047 states and 5732 transitions. [2019-10-02 12:41:42,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:41:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5732 transitions. [2019-10-02 12:41:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:41:42,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:42,958 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:42,959 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash -154989176, now seen corresponding path program 1 times [2019-10-02 12:41:42,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:42,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:43,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:43,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:41:43,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:41:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:41:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:41:43,246 INFO L87 Difference]: Start difference. First operand 4047 states and 5732 transitions. Second operand 6 states. [2019-10-02 12:41:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:44,231 INFO L93 Difference]: Finished difference Result 11214 states and 15982 transitions. [2019-10-02 12:41:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:41:44,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-02 12:41:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:44,304 INFO L225 Difference]: With dead ends: 11214 [2019-10-02 12:41:44,304 INFO L226 Difference]: Without dead ends: 8129 [2019-10-02 12:41:44,324 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 12:41:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2019-10-02 12:41:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 8086. [2019-10-02 12:41:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8086 states. [2019-10-02 12:41:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 11458 transitions. [2019-10-02 12:41:44,720 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 11458 transitions. Word has length 207 [2019-10-02 12:41:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:44,720 INFO L475 AbstractCegarLoop]: Abstraction has 8086 states and 11458 transitions. [2019-10-02 12:41:44,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 11458 transitions. [2019-10-02 12:41:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:41:44,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:44,738 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:44,739 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash 927792726, now seen corresponding path program 1 times [2019-10-02 12:41:44,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:44,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:44,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:44,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:41:44,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:41:44,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:41:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:44,967 INFO L87 Difference]: Start difference. First operand 8086 states and 11458 transitions. Second operand 9 states. [2019-10-02 12:41:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:45,310 INFO L93 Difference]: Finished difference Result 14679 states and 20862 transitions. [2019-10-02 12:41:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:41:45,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2019-10-02 12:41:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:45,386 INFO L225 Difference]: With dead ends: 14679 [2019-10-02 12:41:45,387 INFO L226 Difference]: Without dead ends: 8776 [2019-10-02 12:41:45,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:41:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2019-10-02 12:41:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 8716. [2019-10-02 12:41:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8716 states. [2019-10-02 12:41:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 12428 transitions. [2019-10-02 12:41:45,972 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 12428 transitions. Word has length 208 [2019-10-02 12:41:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:45,975 INFO L475 AbstractCegarLoop]: Abstraction has 8716 states and 12428 transitions. [2019-10-02 12:41:45,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:41:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 12428 transitions. [2019-10-02 12:41:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:41:45,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:45,997 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:45,998 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash -464354170, now seen corresponding path program 1 times [2019-10-02 12:41:45,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:46,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:46,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:46,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:41:46,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:41:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:41:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:41:46,222 INFO L87 Difference]: Start difference. First operand 8716 states and 12428 transitions. Second operand 6 states. [2019-10-02 12:41:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:47,058 INFO L93 Difference]: Finished difference Result 24424 states and 35003 transitions. [2019-10-02 12:41:47,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:41:47,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-10-02 12:41:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:47,161 INFO L225 Difference]: With dead ends: 24424 [2019-10-02 12:41:47,161 INFO L226 Difference]: Without dead ends: 17567 [2019-10-02 12:41:47,205 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 12:41:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17567 states. [2019-10-02 12:41:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17567 to 17404. [2019-10-02 12:41:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17404 states. [2019-10-02 12:41:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17404 states to 17404 states and 24839 transitions. [2019-10-02 12:41:48,629 INFO L78 Accepts]: Start accepts. Automaton has 17404 states and 24839 transitions. Word has length 209 [2019-10-02 12:41:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:48,629 INFO L475 AbstractCegarLoop]: Abstraction has 17404 states and 24839 transitions. [2019-10-02 12:41:48,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 17404 states and 24839 transitions. [2019-10-02 12:41:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 12:41:48,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:48,662 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:48,663 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1595148004, now seen corresponding path program 1 times [2019-10-02 12:41:48,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:48,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:48,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:48,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:48,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:48,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:41:48,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:41:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:41:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:41:48,863 INFO L87 Difference]: Start difference. First operand 17404 states and 24839 transitions. Second operand 9 states. [2019-10-02 12:41:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:49,540 INFO L93 Difference]: Finished difference Result 31567 states and 45065 transitions. [2019-10-02 12:41:49,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:41:49,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2019-10-02 12:41:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:49,621 INFO L225 Difference]: With dead ends: 31567 [2019-10-02 12:41:49,622 INFO L226 Difference]: Without dead ends: 18464 [2019-10-02 12:41:49,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:41:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18464 states. [2019-10-02 12:41:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18464 to 18394. [2019-10-02 12:41:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18394 states. [2019-10-02 12:41:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18394 states to 18394 states and 26314 transitions. [2019-10-02 12:41:50,433 INFO L78 Accepts]: Start accepts. Automaton has 18394 states and 26314 transitions. Word has length 210 [2019-10-02 12:41:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:50,434 INFO L475 AbstractCegarLoop]: Abstraction has 18394 states and 26314 transitions. [2019-10-02 12:41:50,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:41:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18394 states and 26314 transitions. [2019-10-02 12:41:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 12:41:50,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:50,468 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:50,468 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 164838088, now seen corresponding path program 1 times [2019-10-02 12:41:50,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:50,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:50,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:50,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:41:50,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:50,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:41:50,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:41:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:41:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:41:50,638 INFO L87 Difference]: Start difference. First operand 18394 states and 26314 transitions. Second operand 6 states. [2019-10-02 12:41:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:51,977 INFO L93 Difference]: Finished difference Result 51124 states and 73545 transitions. [2019-10-02 12:41:51,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:41:51,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-02 12:41:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:52,116 INFO L225 Difference]: With dead ends: 51124 [2019-10-02 12:41:52,116 INFO L226 Difference]: Without dead ends: 33194 [2019-10-02 12:41:52,197 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 12:41:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-10-02 12:41:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 32899. [2019-10-02 12:41:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32899 states. [2019-10-02 12:41:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32899 states to 32899 states and 47287 transitions. [2019-10-02 12:41:53,884 INFO L78 Accepts]: Start accepts. Automaton has 32899 states and 47287 transitions. Word has length 211 [2019-10-02 12:41:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:53,884 INFO L475 AbstractCegarLoop]: Abstraction has 32899 states and 47287 transitions. [2019-10-02 12:41:53,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:41:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32899 states and 47287 transitions. [2019-10-02 12:41:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 12:41:53,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:53,937 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:53,938 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:53,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2108044564, now seen corresponding path program 1 times [2019-10-02 12:41:53,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:53,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:53,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:54,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:54,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:54,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:54,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:54,051 INFO L87 Difference]: Start difference. First operand 32899 states and 47287 transitions. Second operand 3 states. [2019-10-02 12:41:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:55,961 INFO L93 Difference]: Finished difference Result 67796 states and 98298 transitions. [2019-10-02 12:41:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:55,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 12:41:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:56,074 INFO L225 Difference]: With dead ends: 67796 [2019-10-02 12:41:56,075 INFO L226 Difference]: Without dead ends: 34960 [2019-10-02 12:41:56,142 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 12:41:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34960 states. [2019-10-02 12:41:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34960 to 34939. [2019-10-02 12:41:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34939 states. [2019-10-02 12:41:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34939 states to 34939 states and 51013 transitions. [2019-10-02 12:41:57,713 INFO L78 Accepts]: Start accepts. Automaton has 34939 states and 51013 transitions. Word has length 222 [2019-10-02 12:41:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:57,714 INFO L475 AbstractCegarLoop]: Abstraction has 34939 states and 51013 transitions. [2019-10-02 12:41:57,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:41:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34939 states and 51013 transitions. [2019-10-02 12:41:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:41:57,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:57,747 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:41:57,747 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1248992518, now seen corresponding path program 1 times [2019-10-02 12:41:57,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:57,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:41:57,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:57,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:41:57,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:41:57,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:41:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:57,870 INFO L87 Difference]: Start difference. First operand 34939 states and 51013 transitions. Second operand 3 states. [2019-10-02 12:41:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:58,531 INFO L93 Difference]: Finished difference Result 73676 states and 109092 transitions. [2019-10-02 12:41:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:58,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-10-02 12:41:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:58,641 INFO L225 Difference]: With dead ends: 73676 [2019-10-02 12:41:58,641 INFO L226 Difference]: Without dead ends: 38800 [2019-10-02 12:41:58,715 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 12:41:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38800 states. [2019-10-02 12:42:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38800 to 38779. [2019-10-02 12:42:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38779 states. [2019-10-02 12:42:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38779 states to 38779 states and 58033 transitions. [2019-10-02 12:42:00,236 INFO L78 Accepts]: Start accepts. Automaton has 38779 states and 58033 transitions. Word has length 221 [2019-10-02 12:42:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:00,236 INFO L475 AbstractCegarLoop]: Abstraction has 38779 states and 58033 transitions. [2019-10-02 12:42:00,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 38779 states and 58033 transitions. [2019-10-02 12:42:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 12:42:00,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:00,282 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:42:00,282 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:00,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:00,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1857987982, now seen corresponding path program 1 times [2019-10-02 12:42:00,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:00,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:00,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:00,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:00,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:00,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:00,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:00,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:00,421 INFO L87 Difference]: Start difference. First operand 38779 states and 58033 transitions. Second operand 3 states. [2019-10-02 12:42:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:01,579 INFO L93 Difference]: Finished difference Result 84908 states and 129480 transitions. [2019-10-02 12:42:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:01,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 12:42:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:01,733 INFO L225 Difference]: With dead ends: 84908 [2019-10-02 12:42:01,733 INFO L226 Difference]: Without dead ends: 46192 [2019-10-02 12:42:01,797 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 12:42:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46192 states. [2019-10-02 12:42:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46192 to 46171. [2019-10-02 12:42:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46171 states. [2019-10-02 12:42:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46171 states to 46171 states and 71305 transitions. [2019-10-02 12:42:05,298 INFO L78 Accepts]: Start accepts. Automaton has 46171 states and 71305 transitions. Word has length 222 [2019-10-02 12:42:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:05,299 INFO L475 AbstractCegarLoop]: Abstraction has 46171 states and 71305 transitions. [2019-10-02 12:42:05,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 46171 states and 71305 transitions. [2019-10-02 12:42:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:42:05,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:05,372 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:05,373 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash 158828310, now seen corresponding path program 1 times [2019-10-02 12:42:05,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:05,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:05,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:05,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:05,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:42:05,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:05,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:05,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:05,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:05,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:05,505 INFO L87 Difference]: Start difference. First operand 46171 states and 71305 transitions. Second operand 3 states. [2019-10-02 12:42:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:06,519 INFO L93 Difference]: Finished difference Result 106508 states and 168144 transitions. [2019-10-02 12:42:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:42:06,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-02 12:42:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:06,709 INFO L225 Difference]: With dead ends: 106508 [2019-10-02 12:42:06,709 INFO L226 Difference]: Without dead ends: 60400 [2019-10-02 12:42:06,806 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 12:42:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60400 states. [2019-10-02 12:42:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60400 to 60379. [2019-10-02 12:42:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60379 states. [2019-10-02 12:42:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60379 states to 60379 states and 96505 transitions. [2019-10-02 12:42:08,938 INFO L78 Accepts]: Start accepts. Automaton has 60379 states and 96505 transitions. Word has length 225 [2019-10-02 12:42:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:08,939 INFO L475 AbstractCegarLoop]: Abstraction has 60379 states and 96505 transitions. [2019-10-02 12:42:08,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 60379 states and 96505 transitions. [2019-10-02 12:42:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 12:42:09,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:09,082 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:09,082 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash -25643926, now seen corresponding path program 1 times [2019-10-02 12:42:09,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:09,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:09,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:09,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:42:09,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:42:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:42:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:42:09,258 INFO L87 Difference]: Start difference. First operand 60379 states and 96505 transitions. Second operand 9 states. [2019-10-02 12:42:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:10,742 INFO L93 Difference]: Finished difference Result 86321 states and 133840 transitions. [2019-10-02 12:42:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:42:10,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 226 [2019-10-02 12:42:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:10,947 INFO L225 Difference]: With dead ends: 86321 [2019-10-02 12:42:10,947 INFO L226 Difference]: Without dead ends: 60529 [2019-10-02 12:42:11,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:42:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60529 states. [2019-10-02 12:42:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60529 to 60309. [2019-10-02 12:42:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60309 states. [2019-10-02 12:42:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60309 states to 60309 states and 96292 transitions. [2019-10-02 12:42:14,909 INFO L78 Accepts]: Start accepts. Automaton has 60309 states and 96292 transitions. Word has length 226 [2019-10-02 12:42:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:14,910 INFO L475 AbstractCegarLoop]: Abstraction has 60309 states and 96292 transitions. [2019-10-02 12:42:14,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:42:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 60309 states and 96292 transitions. [2019-10-02 12:42:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 12:42:15,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:15,006 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:15,006 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash -470653586, now seen corresponding path program 1 times [2019-10-02 12:42:15,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:15,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:15,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:15,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:42:15,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:42:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:42:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:42:15,190 INFO L87 Difference]: Start difference. First operand 60309 states and 96292 transitions. Second operand 7 states. [2019-10-02 12:42:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:19,263 INFO L93 Difference]: Finished difference Result 138279 states and 221020 transitions. [2019-10-02 12:42:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:42:19,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-10-02 12:42:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:19,751 INFO L225 Difference]: With dead ends: 138279 [2019-10-02 12:42:19,752 INFO L226 Difference]: Without dead ends: 112547 [2019-10-02 12:42:19,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:42:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112547 states. [2019-10-02 12:42:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112547 to 112537. [2019-10-02 12:42:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112537 states. [2019-10-02 12:42:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112537 states to 112537 states and 179355 transitions. [2019-10-02 12:42:26,171 INFO L78 Accepts]: Start accepts. Automaton has 112537 states and 179355 transitions. Word has length 224 [2019-10-02 12:42:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:26,172 INFO L475 AbstractCegarLoop]: Abstraction has 112537 states and 179355 transitions. [2019-10-02 12:42:26,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:42:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 112537 states and 179355 transitions. [2019-10-02 12:42:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:42:26,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:26,334 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:26,334 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:26,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:26,334 INFO L82 PathProgramCache]: Analyzing trace with hash -474545987, now seen corresponding path program 1 times [2019-10-02 12:42:26,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:26,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:26,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:26,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:26,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:26,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:26,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:42:26,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:42:26,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:42:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:42:26,775 INFO L87 Difference]: Start difference. First operand 112537 states and 179355 transitions. Second operand 26 states. [2019-10-02 12:42:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:30,565 INFO L93 Difference]: Finished difference Result 203580 states and 324451 transitions. [2019-10-02 12:42:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:42:30,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 225 [2019-10-02 12:42:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:31,218 INFO L225 Difference]: With dead ends: 203580 [2019-10-02 12:42:31,219 INFO L226 Difference]: Without dead ends: 125630 [2019-10-02 12:42:31,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 12:42:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125630 states. [2019-10-02 12:42:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125630 to 125439. [2019-10-02 12:42:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125439 states. [2019-10-02 12:42:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125439 states to 125439 states and 199175 transitions. [2019-10-02 12:42:39,644 INFO L78 Accepts]: Start accepts. Automaton has 125439 states and 199175 transitions. Word has length 225 [2019-10-02 12:42:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:39,644 INFO L475 AbstractCegarLoop]: Abstraction has 125439 states and 199175 transitions. [2019-10-02 12:42:39,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:42:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 125439 states and 199175 transitions. [2019-10-02 12:42:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:42:39,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:39,786 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:39,787 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash 219153513, now seen corresponding path program 1 times [2019-10-02 12:42:39,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:39,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:39,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:42:39,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:42:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:42:39,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:42:39,980 INFO L87 Difference]: Start difference. First operand 125439 states and 199175 transitions. Second operand 10 states. [2019-10-02 12:42:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:42,746 INFO L93 Difference]: Finished difference Result 126282 states and 200437 transitions. [2019-10-02 12:42:42,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:42:42,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 229 [2019-10-02 12:42:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:43,342 INFO L225 Difference]: With dead ends: 126282 [2019-10-02 12:42:43,342 INFO L226 Difference]: Without dead ends: 126275 [2019-10-02 12:42:43,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:42:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126275 states. [2019-10-02 12:42:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126275 to 126275. [2019-10-02 12:42:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126275 states. [2019-10-02 12:42:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126275 states to 126275 states and 200154 transitions. [2019-10-02 12:42:51,280 INFO L78 Accepts]: Start accepts. Automaton has 126275 states and 200154 transitions. Word has length 229 [2019-10-02 12:42:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:51,281 INFO L475 AbstractCegarLoop]: Abstraction has 126275 states and 200154 transitions. [2019-10-02 12:42:51,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:42:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 126275 states and 200154 transitions. [2019-10-02 12:42:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 12:42:51,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:51,385 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:51,386 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -68789459, now seen corresponding path program 1 times [2019-10-02 12:42:51,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:51,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:51,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:51,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:51,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:42:51,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:42:51,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:42:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:42:51,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:42:51,516 INFO L87 Difference]: Start difference. First operand 126275 states and 200154 transitions. Second operand 5 states. [2019-10-02 12:42:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:42:54,754 INFO L93 Difference]: Finished difference Result 218419 states and 345774 transitions. [2019-10-02 12:42:54,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:42:54,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-02 12:42:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:42:55,224 INFO L225 Difference]: With dead ends: 218419 [2019-10-02 12:42:55,224 INFO L226 Difference]: Without dead ends: 129348 [2019-10-02 12:42:55,416 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 12:42:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129348 states. [2019-10-02 12:43:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129348 to 127737. [2019-10-02 12:43:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127737 states. [2019-10-02 12:43:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127737 states to 127737 states and 201864 transitions. [2019-10-02 12:43:04,421 INFO L78 Accepts]: Start accepts. Automaton has 127737 states and 201864 transitions. Word has length 234 [2019-10-02 12:43:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:04,422 INFO L475 AbstractCegarLoop]: Abstraction has 127737 states and 201864 transitions. [2019-10-02 12:43:04,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:43:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 127737 states and 201864 transitions. [2019-10-02 12:43:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 12:43:04,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:04,529 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:43:04,529 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -860125851, now seen corresponding path program 1 times [2019-10-02 12:43:04,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:04,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:04,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:04,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:43:04,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:43:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:43:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:43:04,747 INFO L87 Difference]: Start difference. First operand 127737 states and 201864 transitions. Second operand 11 states. [2019-10-02 12:43:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:09,129 INFO L93 Difference]: Finished difference Result 218736 states and 339862 transitions. [2019-10-02 12:43:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:43:09,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2019-10-02 12:43:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:09,707 INFO L225 Difference]: With dead ends: 218736 [2019-10-02 12:43:09,708 INFO L226 Difference]: Without dead ends: 128203 [2019-10-02 12:43:09,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:43:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128203 states. [2019-10-02 12:43:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128203 to 128069. [2019-10-02 12:43:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128069 states. [2019-10-02 12:43:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128069 states to 128069 states and 202002 transitions. [2019-10-02 12:43:19,185 INFO L78 Accepts]: Start accepts. Automaton has 128069 states and 202002 transitions. Word has length 234 [2019-10-02 12:43:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:19,185 INFO L475 AbstractCegarLoop]: Abstraction has 128069 states and 202002 transitions. [2019-10-02 12:43:19,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:43:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 128069 states and 202002 transitions. [2019-10-02 12:43:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:43:19,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:19,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:43:19,294 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1906163853, now seen corresponding path program 1 times [2019-10-02 12:43:19,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:19,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:19,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:43:19,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:43:19,434 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 12:43:20,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:20,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 2936 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:43:20,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:43:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:43:20,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:43:20,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 12:43:20,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:43:20,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:43:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:43:20,881 INFO L87 Difference]: Start difference. First operand 128069 states and 202002 transitions. Second operand 12 states. [2019-10-02 12:43:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:27,139 INFO L93 Difference]: Finished difference Result 237650 states and 375665 transitions. [2019-10-02 12:43:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:43:27,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 238 [2019-10-02 12:43:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:27,758 INFO L225 Difference]: With dead ends: 237650 [2019-10-02 12:43:27,758 INFO L226 Difference]: Without dead ends: 109596 [2019-10-02 12:43:29,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:43:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109596 states. [2019-10-02 12:43:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109596 to 109450. [2019-10-02 12:43:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109450 states. [2019-10-02 12:43:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109450 states to 109450 states and 173047 transitions. [2019-10-02 12:43:42,276 INFO L78 Accepts]: Start accepts. Automaton has 109450 states and 173047 transitions. Word has length 238 [2019-10-02 12:43:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:43:42,277 INFO L475 AbstractCegarLoop]: Abstraction has 109450 states and 173047 transitions. [2019-10-02 12:43:42,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:43:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 109450 states and 173047 transitions. [2019-10-02 12:43:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:43:42,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:43:42,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:43:42,944 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:43:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:43:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1666528082, now seen corresponding path program 1 times [2019-10-02 12:43:42,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:43:42,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:43:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:42,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:43:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:43:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:43:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:43:43,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:43:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:43:43,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:43:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:43:43,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:43:43,336 INFO L87 Difference]: Start difference. First operand 109450 states and 173047 transitions. Second operand 6 states. [2019-10-02 12:43:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:43:50,136 INFO L93 Difference]: Finished difference Result 295371 states and 472348 transitions. [2019-10-02 12:43:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:43:50,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-10-02 12:43:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:43:56,121 INFO L225 Difference]: With dead ends: 295371 [2019-10-02 12:43:56,122 INFO L226 Difference]: Without dead ends: 220971 [2019-10-02 12:43:56,382 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 12:43:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220971 states. [2019-10-02 12:44:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220971 to 218505. [2019-10-02 12:44:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218505 states. [2019-10-02 12:44:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218505 states to 218505 states and 350866 transitions. [2019-10-02 12:44:05,901 INFO L78 Accepts]: Start accepts. Automaton has 218505 states and 350866 transitions. Word has length 238 [2019-10-02 12:44:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:05,902 INFO L475 AbstractCegarLoop]: Abstraction has 218505 states and 350866 transitions. [2019-10-02 12:44:05,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:44:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 218505 states and 350866 transitions. [2019-10-02 12:44:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:44:06,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:06,188 INFO L411 BasicCegarLoop]: trace histogram [3, 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] [2019-10-02 12:44:06,189 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash -840334965, now seen corresponding path program 1 times [2019-10-02 12:44:06,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:06,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:44:06,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:44:06,351 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 12:44:07,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:07,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:44:07,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:44:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:44:08,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:44:08,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 12:44:08,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:44:08,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:44:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:44:08,097 INFO L87 Difference]: Start difference. First operand 218505 states and 350866 transitions. Second operand 11 states. [2019-10-02 12:44:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:23,865 INFO L93 Difference]: Finished difference Result 478741 states and 772313 transitions. [2019-10-02 12:44:23,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:44:23,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 255 [2019-10-02 12:44:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:24,980 INFO L225 Difference]: With dead ends: 478741 [2019-10-02 12:44:24,981 INFO L226 Difference]: Without dead ends: 257607 [2019-10-02 12:44:25,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-10-02 12:44:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257607 states. [2019-10-02 12:44:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257607 to 253870. [2019-10-02 12:44:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253870 states. [2019-10-02 12:44:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253870 states to 253870 states and 401046 transitions. [2019-10-02 12:44:42,181 INFO L78 Accepts]: Start accepts. Automaton has 253870 states and 401046 transitions. Word has length 255 [2019-10-02 12:44:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:42,182 INFO L475 AbstractCegarLoop]: Abstraction has 253870 states and 401046 transitions. [2019-10-02 12:44:42,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:44:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 253870 states and 401046 transitions. [2019-10-02 12:44:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:44:42,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:42,435 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:42,435 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1183627087, now seen corresponding path program 1 times [2019-10-02 12:44:42,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:44:42,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:42,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:44:42,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:44:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:44:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:44:42,640 INFO L87 Difference]: Start difference. First operand 253870 states and 401046 transitions. Second operand 8 states. [2019-10-02 12:45:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:14,959 INFO L93 Difference]: Finished difference Result 767408 states and 1277742 transitions. [2019-10-02 12:45:14,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:45:14,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 280 [2019-10-02 12:45:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:16,940 INFO L225 Difference]: With dead ends: 767408 [2019-10-02 12:45:16,940 INFO L226 Difference]: Without dead ends: 513615 [2019-10-02 12:45:18,239 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 12:45:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513615 states. [2019-10-02 12:45:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513615 to 381496. [2019-10-02 12:45:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381496 states. [2019-10-02 12:45:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381496 states to 381496 states and 646414 transitions. [2019-10-02 12:45:51,459 INFO L78 Accepts]: Start accepts. Automaton has 381496 states and 646414 transitions. Word has length 280 [2019-10-02 12:45:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:51,459 INFO L475 AbstractCegarLoop]: Abstraction has 381496 states and 646414 transitions. [2019-10-02 12:45:51,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:45:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 381496 states and 646414 transitions. [2019-10-02 12:45:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:45:52,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:52,162 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2019-10-02 12:45:52,163 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:52,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1598576967, now seen corresponding path program 1 times [2019-10-02 12:45:52,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:52,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:45:52,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:52,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:45:52,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:45:52,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:45:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:45:52,374 INFO L87 Difference]: Start difference. First operand 381496 states and 646414 transitions. Second operand 8 states. [2019-10-02 12:46:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:54,427 INFO L93 Difference]: Finished difference Result 1156718 states and 2089974 transitions. [2019-10-02 12:46:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:46:54,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 279 [2019-10-02 12:46:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:57,793 INFO L225 Difference]: With dead ends: 1156718 [2019-10-02 12:46:57,794 INFO L226 Difference]: Without dead ends: 775299 [2019-10-02 12:46:58,815 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 12:46:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775299 states. [2019-10-02 12:48:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775299 to 624128. [2019-10-02 12:48:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624128 states. [2019-10-02 12:48:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624128 states to 624128 states and 1151500 transitions. [2019-10-02 12:48:10,780 INFO L78 Accepts]: Start accepts. Automaton has 624128 states and 1151500 transitions. Word has length 279 [2019-10-02 12:48:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:10,780 INFO L475 AbstractCegarLoop]: Abstraction has 624128 states and 1151500 transitions. [2019-10-02 12:48:10,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:48:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 624128 states and 1151500 transitions.