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_spec9_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:13:47,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:13:47,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:13:47,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:13:47,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:13:47,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:13:47,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:13:47,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:13:47,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:13:47,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:13:47,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:13:47,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:13:47,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:13:47,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:13:47,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:13:47,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:13:47,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:13:47,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:13:47,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:13:47,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:13:47,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:13:47,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:13:47,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:13:47,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:13:47,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:13:47,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:13:47,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:13:47,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:13:47,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:13:48,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:13:48,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:13:48,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:13:48,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:13:48,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:13:48,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:13:48,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:13:48,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:13:48,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:13:48,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:13:48,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:13:48,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:13:48,007 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 14:13:48,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:13:48,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:13:48,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:13:48,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:13:48,025 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:13:48,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:13:48,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:13:48,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:13:48,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:13:48,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:13:48,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:13:48,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:13:48,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:13:48,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:13:48,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:13:48,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:13:48,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:13:48,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:13:48,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:13:48,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:13:48,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:13:48,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:13:48,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:13:48,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:13:48,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:13:48,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:13:48,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:13:48,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:13:48,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:13:48,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:13:48,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:13:48,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:13:48,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:13:48,081 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:13:48,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product33.cil.c [2019-10-02 14:13:48,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0760bfa0f/d81d3cdb99244cdba49d5a0c7bb27177/FLAGf0e2220d9 [2019-10-02 14:13:48,874 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:13:48,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product33.cil.c [2019-10-02 14:13:48,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0760bfa0f/d81d3cdb99244cdba49d5a0c7bb27177/FLAGf0e2220d9 [2019-10-02 14:13:48,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0760bfa0f/d81d3cdb99244cdba49d5a0c7bb27177 [2019-10-02 14:13:48,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:13:48,995 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:13:48,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:13:48,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:13:49,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:13:49,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:13:48" (1/1) ... [2019-10-02 14:13:49,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7492c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:49, skipping insertion in model container [2019-10-02 14:13:49,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:13:48" (1/1) ... [2019-10-02 14:13:49,011 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:13:49,091 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:13:49,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:13:49,943 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:13:50,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:13:50,272 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:13:50,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50 WrapperNode [2019-10-02 14:13:50,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:13:50,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:13:50,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:13:50,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:13:50,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (1/1) ... [2019-10-02 14:13:50,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:13:50,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:13:50,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:13:50,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:13:50,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (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 14:13:50,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:13:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:13:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:13:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:13:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 14:13:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 14:13:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:13:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:13:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:13:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:13:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:13:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:13:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:13:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:13:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:13:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:13:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:13:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:13:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:13:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:13:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:13:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:13:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:13:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:13:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 14:13:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 14:13:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:13:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:13:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:13:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:13:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:13:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:13:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:13:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:13:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:13:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:13:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:13:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:13:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:13:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 14:13:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 14:13:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 14:13:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 14:13:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:13:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:13:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:13:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:13:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:13:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:13:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:13:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:13:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:13:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:13:50,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:13:50,595 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:13:50,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:13:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:13:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:13:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:13:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:13:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:13:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:13:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:13:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:13:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:13:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:13:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:13:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:13:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:13:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:13:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:13:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:13:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:13:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 14:13:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 14:13:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:13:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:13:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:13:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:13:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:13:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:13:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:13:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:13:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:13:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:13:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:13:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:13:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:13:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:13:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:13:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:13:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:13:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:13:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:13:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:13:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:13:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:13:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:13:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:13:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:13:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:13:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:13:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:13:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:13:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:13:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:13:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:13:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:13:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:13:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:13:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:13:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:13:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 14:13:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 14:13:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:13:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:13:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:13:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:13:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:13:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:13:50,609 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:13:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:13:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:13:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:13:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:13:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:13:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:13:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:13:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:13:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:13:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:13:50,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:13:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:13:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:13:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:13:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:13:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:13:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:13:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:13:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:13:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:13:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:13:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:13:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:13:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:13:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:13:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:13:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:13:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:13:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:13:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:13:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:13:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:13:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:13:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 14:13:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:13:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 14:13:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:13:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:13:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 14:13:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 14:13:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 14:13:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 14:13:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 14:13:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:13:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:13:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:13:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:13:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:13:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:13:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:13:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:13:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:13:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:13:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:13:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:13:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:13:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:13:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:13:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:13:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:13:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:13:53,038 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:13:53,039 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:13:53,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:13:53 BoogieIcfgContainer [2019-10-02 14:13:53,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:13:53,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:13:53,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:13:53,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:13:53,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:13:48" (1/3) ... [2019-10-02 14:13:53,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b44a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:13:53, skipping insertion in model container [2019-10-02 14:13:53,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:13:50" (2/3) ... [2019-10-02 14:13:53,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b44a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:13:53, skipping insertion in model container [2019-10-02 14:13:53,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:13:53" (3/3) ... [2019-10-02 14:13:53,053 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product33.cil.c [2019-10-02 14:13:53,067 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:13:53,088 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:13:53,119 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:13:53,164 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:13:53,165 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:13:53,165 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:13:53,166 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:13:53,166 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:13:53,166 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:13:53,166 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:13:53,166 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:13:53,166 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:13:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states. [2019-10-02 14:13:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:13:53,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:53,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:53,254 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:53,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1835133867, now seen corresponding path program 1 times [2019-10-02 14:13:53,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:53,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:13:54,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:54,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:13:54,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:13:54,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:13:54,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:13:54,028 INFO L87 Difference]: Start difference. First operand 594 states. Second operand 2 states. [2019-10-02 14:13:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:54,104 INFO L93 Difference]: Finished difference Result 919 states and 1204 transitions. [2019-10-02 14:13:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:13:54,105 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-02 14:13:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:54,130 INFO L225 Difference]: With dead ends: 919 [2019-10-02 14:13:54,130 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 14:13:54,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:13:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 14:13:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-02 14:13:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 14:13:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 753 transitions. [2019-10-02 14:13:54,237 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 753 transitions. Word has length 158 [2019-10-02 14:13:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:54,240 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 753 transitions. [2019-10-02 14:13:54,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:13:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 753 transitions. [2019-10-02 14:13:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 14:13:54,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:54,246 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:54,246 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:54,247 INFO L82 PathProgramCache]: Analyzing trace with hash 582297796, now seen corresponding path program 1 times [2019-10-02 14:13:54,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:54,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:13:54,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:54,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:54,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:54,544 INFO L87 Difference]: Start difference. First operand 571 states and 753 transitions. Second operand 3 states. [2019-10-02 14:13:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:54,637 INFO L93 Difference]: Finished difference Result 902 states and 1172 transitions. [2019-10-02 14:13:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:54,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 14:13:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:54,652 INFO L225 Difference]: With dead ends: 902 [2019-10-02 14:13:54,653 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 14:13:54,662 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 14:13:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 14:13:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 573. [2019-10-02 14:13:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-02 14:13:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 755 transitions. [2019-10-02 14:13:54,731 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 755 transitions. Word has length 159 [2019-10-02 14:13:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:54,732 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 755 transitions. [2019-10-02 14:13:54,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 755 transitions. [2019-10-02 14:13:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 14:13:54,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:54,738 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:54,739 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:54,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2046510219, now seen corresponding path program 1 times [2019-10-02 14:13:54,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:54,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:13:55,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:55,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:55,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:55,033 INFO L87 Difference]: Start difference. First operand 573 states and 755 transitions. Second operand 3 states. [2019-10-02 14:13:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:55,087 INFO L93 Difference]: Finished difference Result 1124 states and 1511 transitions. [2019-10-02 14:13:55,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:55,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 14:13:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:55,097 INFO L225 Difference]: With dead ends: 1124 [2019-10-02 14:13:55,097 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 14:13:55,100 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 14:13:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 14:13:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2019-10-02 14:13:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 14:13:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 827 transitions. [2019-10-02 14:13:55,155 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 827 transitions. Word has length 171 [2019-10-02 14:13:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:55,158 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 827 transitions. [2019-10-02 14:13:55,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 827 transitions. [2019-10-02 14:13:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 14:13:55,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:55,169 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:55,169 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash -866341980, now seen corresponding path program 1 times [2019-10-02 14:13:55,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:13:55,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:55,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:55,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:55,364 INFO L87 Difference]: Start difference. First operand 615 states and 827 transitions. Second operand 3 states. [2019-10-02 14:13:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:55,409 INFO L93 Difference]: Finished difference Result 1247 states and 1722 transitions. [2019-10-02 14:13:55,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:55,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 14:13:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:55,416 INFO L225 Difference]: With dead ends: 1247 [2019-10-02 14:13:55,416 INFO L226 Difference]: Without dead ends: 697 [2019-10-02 14:13:55,418 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 14:13:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-02 14:13:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 696. [2019-10-02 14:13:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-02 14:13:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 965 transitions. [2019-10-02 14:13:55,468 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 965 transitions. Word has length 172 [2019-10-02 14:13:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:55,468 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 965 transitions. [2019-10-02 14:13:55,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 965 transitions. [2019-10-02 14:13:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 14:13:55,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:55,477 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:55,477 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1566529269, now seen corresponding path program 1 times [2019-10-02 14:13:55,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:55,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:55,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:13:55,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:55,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:55,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:55,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:55,914 INFO L87 Difference]: Start difference. First operand 696 states and 965 transitions. Second operand 3 states. [2019-10-02 14:13:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:55,970 INFO L93 Difference]: Finished difference Result 1484 states and 2126 transitions. [2019-10-02 14:13:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:55,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-02 14:13:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:55,977 INFO L225 Difference]: With dead ends: 1484 [2019-10-02 14:13:55,978 INFO L226 Difference]: Without dead ends: 853 [2019-10-02 14:13:55,981 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 14:13:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-02 14:13:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 852. [2019-10-02 14:13:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-10-02 14:13:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1229 transitions. [2019-10-02 14:13:56,032 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1229 transitions. Word has length 173 [2019-10-02 14:13:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:56,033 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1229 transitions. [2019-10-02 14:13:56,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1229 transitions. [2019-10-02 14:13:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 14:13:56,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:56,041 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:56,041 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1766682355, now seen corresponding path program 1 times [2019-10-02 14:13:56,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:56,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:13:56,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:56,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:56,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:56,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:56,255 INFO L87 Difference]: Start difference. First operand 852 states and 1229 transitions. Second operand 3 states. [2019-10-02 14:13:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:56,307 INFO L93 Difference]: Finished difference Result 1271 states and 1777 transitions. [2019-10-02 14:13:56,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:56,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 14:13:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:56,314 INFO L225 Difference]: With dead ends: 1271 [2019-10-02 14:13:56,315 INFO L226 Difference]: Without dead ends: 945 [2019-10-02 14:13:56,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 14:13:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-02 14:13:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2019-10-02 14:13:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-10-02 14:13:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1352 transitions. [2019-10-02 14:13:56,367 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1352 transitions. Word has length 175 [2019-10-02 14:13:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:56,369 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1352 transitions. [2019-10-02 14:13:56,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1352 transitions. [2019-10-02 14:13:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 14:13:56,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:56,378 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:56,379 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2119106243, now seen corresponding path program 1 times [2019-10-02 14:13:56,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:56,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 14:13:57,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:57,153 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 14:13:57,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:57,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 3614 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:13:57,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 14:13:58,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:13:58,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 14:13:58,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:13:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:13:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:13:58,492 INFO L87 Difference]: Start difference. First operand 945 states and 1352 transitions. Second operand 29 states. [2019-10-02 14:14:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:32,485 INFO L93 Difference]: Finished difference Result 4284 states and 6072 transitions. [2019-10-02 14:14:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-10-02 14:14:32,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 329 [2019-10-02 14:14:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:32,508 INFO L225 Difference]: With dead ends: 4284 [2019-10-02 14:14:32,508 INFO L226 Difference]: Without dead ends: 3369 [2019-10-02 14:14:32,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5969 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1453, Invalid=17453, Unknown=0, NotChecked=0, Total=18906 [2019-10-02 14:14:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2019-10-02 14:14:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3019. [2019-10-02 14:14:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2019-10-02 14:14:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4288 transitions. [2019-10-02 14:14:32,694 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4288 transitions. Word has length 329 [2019-10-02 14:14:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:32,694 INFO L475 AbstractCegarLoop]: Abstraction has 3019 states and 4288 transitions. [2019-10-02 14:14:32,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:14:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4288 transitions. [2019-10-02 14:14:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:14:32,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:32,712 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:32,713 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -868921529, now seen corresponding path program 1 times [2019-10-02 14:14:32,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:32,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:32,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:32,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:14:33,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:33,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:14:33,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:14:33,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:14:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:14:33,164 INFO L87 Difference]: Start difference. First operand 3019 states and 4288 transitions. Second operand 5 states. [2019-10-02 14:14:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:33,305 INFO L93 Difference]: Finished difference Result 4712 states and 6484 transitions. [2019-10-02 14:14:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:14:33,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 332 [2019-10-02 14:14:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:33,333 INFO L225 Difference]: With dead ends: 4712 [2019-10-02 14:14:33,333 INFO L226 Difference]: Without dead ends: 2940 [2019-10-02 14:14:33,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:14:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2019-10-02 14:14:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2926. [2019-10-02 14:14:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2926 states. [2019-10-02 14:14:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4149 transitions. [2019-10-02 14:14:33,510 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4149 transitions. Word has length 332 [2019-10-02 14:14:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:33,511 INFO L475 AbstractCegarLoop]: Abstraction has 2926 states and 4149 transitions. [2019-10-02 14:14:33,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:14:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4149 transitions. [2019-10-02 14:14:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 14:14:33,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:33,530 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:33,530 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash -450696728, now seen corresponding path program 1 times [2019-10-02 14:14:33,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 14:14:34,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:14:34,136 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 14:14:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:34,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 3616 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:14:34,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:14:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 14:14:35,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:14:35,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:14:35,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:14:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:14:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:14:35,142 INFO L87 Difference]: Start difference. First operand 2926 states and 4149 transitions. Second operand 23 states. [2019-10-02 14:15:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:01,564 INFO L93 Difference]: Finished difference Result 6340 states and 8977 transitions. [2019-10-02 14:15:01,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-02 14:15:01,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 331 [2019-10-02 14:15:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:01,590 INFO L225 Difference]: With dead ends: 6340 [2019-10-02 14:15:01,590 INFO L226 Difference]: Without dead ends: 3461 [2019-10-02 14:15:01,605 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4698 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1255, Invalid=13507, Unknown=0, NotChecked=0, Total=14762 [2019-10-02 14:15:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2019-10-02 14:15:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2930. [2019-10-02 14:15:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2019-10-02 14:15:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4154 transitions. [2019-10-02 14:15:01,774 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 4154 transitions. Word has length 331 [2019-10-02 14:15:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:01,775 INFO L475 AbstractCegarLoop]: Abstraction has 2930 states and 4154 transitions. [2019-10-02 14:15:01,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:15:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 4154 transitions. [2019-10-02 14:15:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:15:01,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:01,801 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:01,801 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1448175740, now seen corresponding path program 1 times [2019-10-02 14:15:01,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:01,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:01,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:01,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 14:15:02,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:02,202 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:02,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 3617 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:15:02,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:15:03,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:15:03,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2019-10-02 14:15:03,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:15:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:15:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:15:03,173 INFO L87 Difference]: Start difference. First operand 2930 states and 4154 transitions. Second operand 23 states. [2019-10-02 14:15:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:06,037 INFO L93 Difference]: Finished difference Result 5953 states and 8468 transitions. [2019-10-02 14:15:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:15:06,044 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 332 [2019-10-02 14:15:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:06,062 INFO L225 Difference]: With dead ends: 5953 [2019-10-02 14:15:06,063 INFO L226 Difference]: Without dead ends: 2969 [2019-10-02 14:15:06,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:15:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2019-10-02 14:15:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2899. [2019-10-02 14:15:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2019-10-02 14:15:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 4086 transitions. [2019-10-02 14:15:06,209 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 4086 transitions. Word has length 332 [2019-10-02 14:15:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:06,210 INFO L475 AbstractCegarLoop]: Abstraction has 2899 states and 4086 transitions. [2019-10-02 14:15:06,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:15:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 4086 transitions. [2019-10-02 14:15:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 14:15:06,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:06,227 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:06,228 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash 75582123, now seen corresponding path program 1 times [2019-10-02 14:15:06,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:06,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:06,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:06,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 14:15:06,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:06,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:06,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:07,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 3618 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:15:07,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:15:07,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:15:07,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 14:15:07,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:15:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:15:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:15:07,374 INFO L87 Difference]: Start difference. First operand 2899 states and 4086 transitions. Second operand 12 states. [2019-10-02 14:15:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:13,641 INFO L93 Difference]: Finished difference Result 8646 states and 12163 transitions. [2019-10-02 14:15:13,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:15:13,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 333 [2019-10-02 14:15:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:13,688 INFO L225 Difference]: With dead ends: 8646 [2019-10-02 14:15:13,689 INFO L226 Difference]: Without dead ends: 5818 [2019-10-02 14:15:13,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:15:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2019-10-02 14:15:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5570. [2019-10-02 14:15:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2019-10-02 14:15:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 7809 transitions. [2019-10-02 14:15:14,311 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 7809 transitions. Word has length 333 [2019-10-02 14:15:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:14,311 INFO L475 AbstractCegarLoop]: Abstraction has 5570 states and 7809 transitions. [2019-10-02 14:15:14,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:15:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 7809 transitions. [2019-10-02 14:15:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 14:15:14,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:14,359 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:14,360 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:14,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1568995243, now seen corresponding path program 1 times [2019-10-02 14:15:14,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:14,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:14,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-02 14:15:14,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:14,877 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:15,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:15,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 3617 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:15:15,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:15:15,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:15:15,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 14:15:15,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:15:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:15:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:15:15,766 INFO L87 Difference]: Start difference. First operand 5570 states and 7809 transitions. Second operand 14 states. [2019-10-02 14:15:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:25,890 INFO L93 Difference]: Finished difference Result 18746 states and 26768 transitions. [2019-10-02 14:15:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:15:25,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 336 [2019-10-02 14:15:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:25,970 INFO L225 Difference]: With dead ends: 18746 [2019-10-02 14:15:25,970 INFO L226 Difference]: Without dead ends: 13240 [2019-10-02 14:15:26,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:15:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2019-10-02 14:15:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 12692. [2019-10-02 14:15:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12692 states. [2019-10-02 14:15:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12692 states to 12692 states and 17826 transitions. [2019-10-02 14:15:26,623 INFO L78 Accepts]: Start accepts. Automaton has 12692 states and 17826 transitions. Word has length 336 [2019-10-02 14:15:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:26,623 INFO L475 AbstractCegarLoop]: Abstraction has 12692 states and 17826 transitions. [2019-10-02 14:15:26,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:15:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12692 states and 17826 transitions. [2019-10-02 14:15:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 14:15:26,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:26,684 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:26,685 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2009315272, now seen corresponding path program 1 times [2019-10-02 14:15:26,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:26,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:26,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 14:15:26,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:26,965 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:27,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:28,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 3677 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:15:28,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 14:15:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:15:28,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 14:15:28,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:15:28,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:15:28,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:15:28,491 INFO L87 Difference]: Start difference. First operand 12692 states and 17826 transitions. Second operand 10 states. [2019-10-02 14:15:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:29,906 INFO L93 Difference]: Finished difference Result 25607 states and 36071 transitions. [2019-10-02 14:15:29,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:15:29,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 352 [2019-10-02 14:15:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:29,978 INFO L225 Difference]: With dead ends: 25607 [2019-10-02 14:15:29,978 INFO L226 Difference]: Without dead ends: 12995 [2019-10-02 14:15:30,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:15:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12995 states. [2019-10-02 14:15:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12995 to 12864. [2019-10-02 14:15:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12864 states. [2019-10-02 14:15:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12864 states to 12864 states and 18038 transitions. [2019-10-02 14:15:30,843 INFO L78 Accepts]: Start accepts. Automaton has 12864 states and 18038 transitions. Word has length 352 [2019-10-02 14:15:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:30,843 INFO L475 AbstractCegarLoop]: Abstraction has 12864 states and 18038 transitions. [2019-10-02 14:15:30,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:15:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12864 states and 18038 transitions. [2019-10-02 14:15:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-02 14:15:30,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:30,893 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:30,893 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1524315544, now seen corresponding path program 1 times [2019-10-02 14:15:30,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 14:15:31,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:31,165 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:31,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:31,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 3743 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:15:31,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:15:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:15:31,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:15:31,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:15:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:15:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:15:31,955 INFO L87 Difference]: Start difference. First operand 12864 states and 18038 transitions. Second operand 11 states. [2019-10-02 14:15:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:35,815 INFO L93 Difference]: Finished difference Result 49643 states and 70986 transitions. [2019-10-02 14:15:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:15:35,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2019-10-02 14:15:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:36,052 INFO L225 Difference]: With dead ends: 49643 [2019-10-02 14:15:36,052 INFO L226 Difference]: Without dead ends: 38253 [2019-10-02 14:15:36,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:15:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38253 states. [2019-10-02 14:15:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38253 to 37943. [2019-10-02 14:15:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37943 states. [2019-10-02 14:15:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37943 states to 37943 states and 53706 transitions. [2019-10-02 14:15:37,964 INFO L78 Accepts]: Start accepts. Automaton has 37943 states and 53706 transitions. Word has length 371 [2019-10-02 14:15:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:37,964 INFO L475 AbstractCegarLoop]: Abstraction has 37943 states and 53706 transitions. [2019-10-02 14:15:37,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:15:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 37943 states and 53706 transitions. [2019-10-02 14:15:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 14:15:38,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:38,110 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:38,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1192335064, now seen corresponding path program 1 times [2019-10-02 14:15:38,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:38,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:38,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 14:15:38,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:38,343 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:38,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:39,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 3650 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:15:39,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:15:40,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:15:40,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-10-02 14:15:40,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:15:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:15:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:15:40,591 INFO L87 Difference]: Start difference. First operand 37943 states and 53706 transitions. Second operand 8 states. [2019-10-02 14:15:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:41,948 INFO L93 Difference]: Finished difference Result 75035 states and 106091 transitions. [2019-10-02 14:15:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:15:41,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 351 [2019-10-02 14:15:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:42,106 INFO L225 Difference]: With dead ends: 75035 [2019-10-02 14:15:42,106 INFO L226 Difference]: Without dead ends: 37210 [2019-10-02 14:15:42,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:15:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37210 states. [2019-10-02 14:15:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37210 to 37207. [2019-10-02 14:15:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37207 states. [2019-10-02 14:15:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37207 states to 37207 states and 52497 transitions. [2019-10-02 14:15:43,827 INFO L78 Accepts]: Start accepts. Automaton has 37207 states and 52497 transitions. Word has length 351 [2019-10-02 14:15:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:43,828 INFO L475 AbstractCegarLoop]: Abstraction has 37207 states and 52497 transitions. [2019-10-02 14:15:43,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:15:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37207 states and 52497 transitions. [2019-10-02 14:15:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-02 14:15:43,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:43,903 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:43,904 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1387997134, now seen corresponding path program 1 times [2019-10-02 14:15:43,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:43,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:43,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:43,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:43,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:15:44,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:44,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:44,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:44,090 INFO L87 Difference]: Start difference. First operand 37207 states and 52497 transitions. Second operand 3 states. [2019-10-02 14:15:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:45,258 INFO L93 Difference]: Finished difference Result 76021 states and 107919 transitions. [2019-10-02 14:15:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:45,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-10-02 14:15:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:45,403 INFO L225 Difference]: With dead ends: 76021 [2019-10-02 14:15:45,404 INFO L226 Difference]: Without dead ends: 38944 [2019-10-02 14:15:45,474 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 14:15:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38944 states. [2019-10-02 14:15:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38944 to 38941. [2019-10-02 14:15:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38941 states. [2019-10-02 14:15:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38941 states to 38941 states and 55526 transitions. [2019-10-02 14:15:47,202 INFO L78 Accepts]: Start accepts. Automaton has 38941 states and 55526 transitions. Word has length 339 [2019-10-02 14:15:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:47,203 INFO L475 AbstractCegarLoop]: Abstraction has 38941 states and 55526 transitions. [2019-10-02 14:15:47,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38941 states and 55526 transitions. [2019-10-02 14:15:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-02 14:15:47,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:47,264 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:47,264 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1379498918, now seen corresponding path program 1 times [2019-10-02 14:15:47,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:47,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:47,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:47,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:15:47,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:47,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:47,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:47,443 INFO L87 Difference]: Start difference. First operand 38941 states and 55526 transitions. Second operand 3 states. [2019-10-02 14:15:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:48,292 INFO L93 Difference]: Finished difference Result 81059 states and 116793 transitions. [2019-10-02 14:15:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:48,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-10-02 14:15:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:48,418 INFO L225 Difference]: With dead ends: 81059 [2019-10-02 14:15:48,418 INFO L226 Difference]: Without dead ends: 42258 [2019-10-02 14:15:48,508 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 14:15:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42258 states. [2019-10-02 14:15:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42258 to 42255. [2019-10-02 14:15:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42255 states. [2019-10-02 14:15:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42255 states to 42255 states and 61335 transitions. [2019-10-02 14:15:51,540 INFO L78 Accepts]: Start accepts. Automaton has 42255 states and 61335 transitions. Word has length 339 [2019-10-02 14:15:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:51,541 INFO L475 AbstractCegarLoop]: Abstraction has 42255 states and 61335 transitions. [2019-10-02 14:15:51,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42255 states and 61335 transitions. [2019-10-02 14:15:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-02 14:15:51,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:51,615 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:51,616 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1905875321, now seen corresponding path program 1 times [2019-10-02 14:15:51,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:51,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:15:51,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:51,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:51,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:51,797 INFO L87 Difference]: Start difference. First operand 42255 states and 61335 transitions. Second operand 3 states. [2019-10-02 14:15:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:52,995 INFO L93 Difference]: Finished difference Result 90705 states and 133731 transitions. [2019-10-02 14:15:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:52,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-10-02 14:15:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:53,157 INFO L225 Difference]: With dead ends: 90705 [2019-10-02 14:15:53,158 INFO L226 Difference]: Without dead ends: 48596 [2019-10-02 14:15:53,248 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 14:15:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48596 states. [2019-10-02 14:15:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48596 to 48593. [2019-10-02 14:15:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48593 states. [2019-10-02 14:15:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48593 states to 48593 states and 72376 transitions. [2019-10-02 14:15:55,198 INFO L78 Accepts]: Start accepts. Automaton has 48593 states and 72376 transitions. Word has length 347 [2019-10-02 14:15:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:55,199 INFO L475 AbstractCegarLoop]: Abstraction has 48593 states and 72376 transitions. [2019-10-02 14:15:55,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:15:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 48593 states and 72376 transitions. [2019-10-02 14:15:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 14:15:55,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:55,299 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:55,299 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash 845377904, now seen corresponding path program 1 times [2019-10-02 14:15:55,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:55,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:55,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:15:55,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:55,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:15:55,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:15:55,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:15:55,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:15:55,491 INFO L87 Difference]: Start difference. First operand 48593 states and 72376 transitions. Second operand 3 states. [2019-10-02 14:15:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:57,421 INFO L93 Difference]: Finished difference Result 109905 states and 167040 transitions. [2019-10-02 14:15:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:15:57,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-10-02 14:15:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:57,680 INFO L225 Difference]: With dead ends: 109905 [2019-10-02 14:15:57,680 INFO L226 Difference]: Without dead ends: 61462 [2019-10-02 14:15:57,801 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 14:15:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61462 states. [2019-10-02 14:16:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61462 to 61459. [2019-10-02 14:16:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61459 states. [2019-10-02 14:16:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61459 states to 61459 states and 94457 transitions. [2019-10-02 14:16:00,657 INFO L78 Accepts]: Start accepts. Automaton has 61459 states and 94457 transitions. Word has length 375 [2019-10-02 14:16:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:00,657 INFO L475 AbstractCegarLoop]: Abstraction has 61459 states and 94457 transitions. [2019-10-02 14:16:00,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 61459 states and 94457 transitions. [2019-10-02 14:16:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 14:16:00,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:00,832 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:00,832 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1221299375, now seen corresponding path program 1 times [2019-10-02 14:16:00,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:00,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:00,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 14:16:01,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:01,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:01,024 INFO L87 Difference]: Start difference. First operand 61459 states and 94457 transitions. Second operand 3 states. [2019-10-02 14:16:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:05,687 INFO L93 Difference]: Finished difference Result 146577 states and 229434 transitions. [2019-10-02 14:16:05,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:05,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-10-02 14:16:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:05,947 INFO L225 Difference]: With dead ends: 146577 [2019-10-02 14:16:05,948 INFO L226 Difference]: Without dead ends: 85276 [2019-10-02 14:16:06,051 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 14:16:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85276 states. [2019-10-02 14:16:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85276 to 85273. [2019-10-02 14:16:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85273 states. [2019-10-02 14:16:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85273 states to 85273 states and 134398 transitions. [2019-10-02 14:16:09,662 INFO L78 Accepts]: Start accepts. Automaton has 85273 states and 134398 transitions. Word has length 357 [2019-10-02 14:16:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:09,663 INFO L475 AbstractCegarLoop]: Abstraction has 85273 states and 134398 transitions. [2019-10-02 14:16:09,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 85273 states and 134398 transitions. [2019-10-02 14:16:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-02 14:16:09,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:09,948 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:09,948 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash -554766537, now seen corresponding path program 1 times [2019-10-02 14:16:09,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:09,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:09,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:09,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 14:16:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:10,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:10,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:10,156 INFO L87 Difference]: Start difference. First operand 85273 states and 134398 transitions. Second operand 3 states. [2019-10-02 14:16:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:17,019 INFO L93 Difference]: Finished difference Result 215695 states and 346164 transitions. [2019-10-02 14:16:17,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:17,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-10-02 14:16:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:17,418 INFO L225 Difference]: With dead ends: 215695 [2019-10-02 14:16:17,419 INFO L226 Difference]: Without dead ends: 130590 [2019-10-02 14:16:17,551 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 14:16:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130590 states. [2019-10-02 14:16:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130590 to 130587. [2019-10-02 14:16:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130587 states. [2019-10-02 14:16:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130587 states to 130587 states and 210431 transitions. [2019-10-02 14:16:26,259 INFO L78 Accepts]: Start accepts. Automaton has 130587 states and 210431 transitions. Word has length 364 [2019-10-02 14:16:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:26,259 INFO L475 AbstractCegarLoop]: Abstraction has 130587 states and 210431 transitions. [2019-10-02 14:16:26,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 130587 states and 210431 transitions. [2019-10-02 14:16:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 14:16:26,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:26,713 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:26,713 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:26,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1614427193, now seen corresponding path program 1 times [2019-10-02 14:16:26,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:26,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:16:26,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:26,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:16:26,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:16:26,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:16:26,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:16:26,906 INFO L87 Difference]: Start difference. First operand 130587 states and 210431 transitions. Second operand 3 states. [2019-10-02 14:16:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:35,639 INFO L93 Difference]: Finished difference Result 251354 states and 401607 transitions. [2019-10-02 14:16:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:16:35,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-10-02 14:16:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:36,297 INFO L225 Difference]: With dead ends: 251354 [2019-10-02 14:16:36,298 INFO L226 Difference]: Without dead ends: 216594 [2019-10-02 14:16:36,420 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 14:16:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216594 states. [2019-10-02 14:16:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216594 to 216591. [2019-10-02 14:16:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216591 states. [2019-10-02 14:16:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216591 states to 216591 states and 350191 transitions. [2019-10-02 14:16:52,873 INFO L78 Accepts]: Start accepts. Automaton has 216591 states and 350191 transitions. Word has length 351 [2019-10-02 14:16:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:52,874 INFO L475 AbstractCegarLoop]: Abstraction has 216591 states and 350191 transitions. [2019-10-02 14:16:52,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:16:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 216591 states and 350191 transitions. [2019-10-02 14:16:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-02 14:16:53,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:53,738 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:16:53,738 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1155158708, now seen corresponding path program 1 times [2019-10-02 14:16:53,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:53,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:53,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:53,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 14:16:54,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:16:54,003 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:16:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:55,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 3707 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:16:55,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:16:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 14:16:55,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:16:55,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 14:16:55,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:16:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:16:55,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:16:55,859 INFO L87 Difference]: Start difference. First operand 216591 states and 350191 transitions. Second operand 18 states. [2019-10-02 14:17:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:23,095 INFO L93 Difference]: Finished difference Result 443066 states and 724724 transitions. [2019-10-02 14:17:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 14:17:23,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 360 [2019-10-02 14:17:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:24,633 INFO L225 Difference]: With dead ends: 443066 [2019-10-02 14:17:24,633 INFO L226 Difference]: Without dead ends: 422691 [2019-10-02 14:17:24,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=1710, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:17:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422691 states. [2019-10-02 14:17:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422691 to 420331. [2019-10-02 14:17:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420331 states. [2019-10-02 14:18:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420331 states to 420331 states and 692004 transitions. [2019-10-02 14:18:00,186 INFO L78 Accepts]: Start accepts. Automaton has 420331 states and 692004 transitions. Word has length 360 [2019-10-02 14:18:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:18:00,186 INFO L475 AbstractCegarLoop]: Abstraction has 420331 states and 692004 transitions. [2019-10-02 14:18:00,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 14:18:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 420331 states and 692004 transitions. [2019-10-02 14:18:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-02 14:18:10,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:18:10,227 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:18:10,228 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:18:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:18:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1534334099, now seen corresponding path program 1 times [2019-10-02 14:18:10,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:18:10,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:18:10,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:10,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:10,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 14:18:10,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:18:10,453 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:18:10,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:18:11,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 3648 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:18:11,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:18:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 14:18:11,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:18:11,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-02 14:18:11,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 14:18:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 14:18:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-10-02 14:18:11,370 INFO L87 Difference]: Start difference. First operand 420331 states and 692004 transitions. Second operand 20 states. [2019-10-02 14:18:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:18:35,995 INFO L93 Difference]: Finished difference Result 435162 states and 710697 transitions. [2019-10-02 14:18:35,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:18:35,996 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 346 [2019-10-02 14:18:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:18:37,375 INFO L225 Difference]: With dead ends: 435162 [2019-10-02 14:18:37,375 INFO L226 Difference]: Without dead ends: 394923 [2019-10-02 14:18:37,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:18:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394923 states. [2019-10-02 14:19:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394923 to 393173. [2019-10-02 14:19:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393173 states. [2019-10-02 14:19:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393173 states to 393173 states and 654691 transitions. [2019-10-02 14:19:10,749 INFO L78 Accepts]: Start accepts. Automaton has 393173 states and 654691 transitions. Word has length 346 [2019-10-02 14:19:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:19:10,749 INFO L475 AbstractCegarLoop]: Abstraction has 393173 states and 654691 transitions. [2019-10-02 14:19:10,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 14:19:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 393173 states and 654691 transitions. [2019-10-02 14:19:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 14:19:12,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:19:12,370 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:19:12,370 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:19:12,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:19:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash -782661783, now seen corresponding path program 1 times [2019-10-02 14:19:12,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:19:12,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:19:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:12,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:19:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 14:19:12,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:19:12,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:19:12,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:19:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:19:13,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 3817 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:19:13,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:19:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 14:19:21,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:19:21,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-02 14:19:21,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:19:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:19:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:19:21,936 INFO L87 Difference]: Start difference. First operand 393173 states and 654691 transitions. Second operand 34 states. [2019-10-02 14:20:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:20:04,833 INFO L93 Difference]: Finished difference Result 408682 states and 674537 transitions. [2019-10-02 14:20:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-10-02 14:20:04,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 390 [2019-10-02 14:20:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:20:06,239 INFO L225 Difference]: With dead ends: 408682 [2019-10-02 14:20:06,239 INFO L226 Difference]: Without dead ends: 393240 [2019-10-02 14:20:06,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6035 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1269, Invalid=17637, Unknown=0, NotChecked=0, Total=18906 [2019-10-02 14:20:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393240 states. [2019-10-02 14:20:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393240 to 382613. [2019-10-02 14:20:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382613 states. [2019-10-02 14:20:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382613 states to 382613 states and 640167 transitions. [2019-10-02 14:20:42,136 INFO L78 Accepts]: Start accepts. Automaton has 382613 states and 640167 transitions. Word has length 390 [2019-10-02 14:20:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:20:42,137 INFO L475 AbstractCegarLoop]: Abstraction has 382613 states and 640167 transitions. [2019-10-02 14:20:42,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:20:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 382613 states and 640167 transitions. [2019-10-02 14:20:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-10-02 14:20:44,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:20:44,662 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:20:44,662 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:20:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:20:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash -927146217, now seen corresponding path program 1 times [2019-10-02 14:20:44,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:20:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:20:44,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:44,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:44,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:20:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 14:20:45,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:20:45,122 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:20:45,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:20:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:20:53,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 3691 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:20:53,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:20:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:20:53,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:20:53,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9] total 31 [2019-10-02 14:20:53,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:20:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:20:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=868, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:20:53,600 INFO L87 Difference]: Start difference. First operand 382613 states and 640167 transitions. Second operand 31 states. [2019-10-02 14:22:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:22:07,487 INFO L93 Difference]: Finished difference Result 1145648 states and 1976760 transitions. [2019-10-02 14:22:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-02 14:22:07,488 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 356 [2019-10-02 14:22:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:22:11,929 INFO L225 Difference]: With dead ends: 1145648 [2019-10-02 14:22:11,930 INFO L226 Difference]: Without dead ends: 1113967 [2019-10-02 14:22:12,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1910 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=483, Invalid=8073, Unknown=0, NotChecked=0, Total=8556 [2019-10-02 14:22:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113967 states. [2019-10-02 14:23:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113967 to 753892. [2019-10-02 14:23:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753892 states. [2019-10-02 14:23:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753892 states to 753892 states and 1301293 transitions. [2019-10-02 14:23:45,434 INFO L78 Accepts]: Start accepts. Automaton has 753892 states and 1301293 transitions. Word has length 356 [2019-10-02 14:23:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:23:45,434 INFO L475 AbstractCegarLoop]: Abstraction has 753892 states and 1301293 transitions. [2019-10-02 14:23:45,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:23:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 753892 states and 1301293 transitions. [2019-10-02 14:24:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-10-02 14:24:04,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:24:04,013 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:24:04,013 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:24:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:24:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1257334458, now seen corresponding path program 1 times [2019-10-02 14:24:04,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:24:04,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:24:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:04,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:24:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 14:24:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:24:04,278 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:24:04,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:24:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:24:06,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 3815 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:24:06,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:24:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 14:24:06,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:24:06,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2019-10-02 14:24:06,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 14:24:06,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 14:24:06,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:24:06,953 INFO L87 Difference]: Start difference. First operand 753892 states and 1301293 transitions. Second operand 25 states.