java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec3_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:22:10,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:22:10,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:22:10,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:22:10,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:22:10,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:22:10,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:22:10,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:22:10,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:22:10,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:22:10,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:22:10,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:22:10,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:22:10,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:22:10,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:22:10,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:22:10,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:22:10,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:22:10,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:22:10,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:22:10,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:22:10,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:22:10,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:22:10,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:22:10,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:22:10,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:22:10,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:22:10,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:22:10,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:22:10,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:22:10,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:22:10,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:22:10,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:22:10,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:22:10,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:22:10,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:22:10,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:22:10,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:22:10,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:22:10,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:22:10,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:22:10,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:22:10,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:22:10,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:22:10,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:22:10,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:22:10,497 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:22:10,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:22:10,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:22:10,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:22:10,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:22:10,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:22:10,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:22:10,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:22:10,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:22:10,499 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:22:10,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:22:10,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:22:10,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:22:10,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:22:10,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:22:10,503 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:22:10,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:22:10,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:22:10,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:22:10,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:22:10,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:22:10,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:22:10,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:22:10,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:22:10,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:22:10,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:22:10,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:22:10,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:22:10,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:22:10,573 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:22:10,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product32.cil.c [2019-10-02 13:22:10,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2017b9651/20e97eb5d7614563829c180ddaff394d/FLAG32f5017e3 [2019-10-02 13:22:11,233 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:22:11,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product32.cil.c [2019-10-02 13:22:11,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2017b9651/20e97eb5d7614563829c180ddaff394d/FLAG32f5017e3 [2019-10-02 13:22:11,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2017b9651/20e97eb5d7614563829c180ddaff394d [2019-10-02 13:22:11,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:22:11,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:22:11,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:22:11,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:22:11,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:22:11,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:22:11" (1/1) ... [2019-10-02 13:22:11,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429df39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:11, skipping insertion in model container [2019-10-02 13:22:11,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:22:11" (1/1) ... [2019-10-02 13:22:11,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:22:11,579 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:22:12,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:22:12,382 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:22:12,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:22:12,599 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:22:12,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12 WrapperNode [2019-10-02 13:22:12,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:22:12,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:22:12,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:22:12,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:22:12,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... [2019-10-02 13:22:12,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:22:12,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:22:12,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:22:12,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:22:12,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:22:12,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:22:12,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:22:12,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:22:12,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:22:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:22:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:22:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:22:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:22:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:22:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:22:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:22:12,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:22:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:22:12,954 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:22:12,955 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:22:12,955 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:22:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:22:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:22:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:22:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:22:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:22:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:22:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:22:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:22:12,958 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:22:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:22:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:22:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:22:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:22:12,959 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:22:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:22:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:22:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:22:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:22:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:22:12,960 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:22:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:22:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:22:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:22:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:22:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:22:12,961 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:22:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:22:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:22:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:22:12,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:22:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:22:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:22:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:22:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:22:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:22:12,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:22:12,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:22:12,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:22:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:22:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:22:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:22:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:22:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:22:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:22:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:22:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:22:12,968 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:22:12,968 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:22:12,968 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:22:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:22:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:22:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:22:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:22:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:22:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:22:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:22:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:22:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:22:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:22:12,972 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:22:12,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:22:12,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:22:12,973 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:22:12,973 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:22:12,974 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:22:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:22:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:22:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:22:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:22:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:22:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:22:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:22:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:22:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:22:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:22:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:22:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:22:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:22:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:22:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:22:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:22:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:22:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:22:12,980 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:22:12,981 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:22:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:22:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:22:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:22:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:22:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:22:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:22:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:22:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:22:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:22:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:22:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:22:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:22:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:22:12,985 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:22:12,986 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:22:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:22:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:22:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:22:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:22:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:22:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:22:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:22:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:22:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:22:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:22:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:22:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:22:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:22:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:22:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:22:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:22:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:22:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:22:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:22:13,002 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:22:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:22:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:22:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:22:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:22:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:22:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:22:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:22:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:22:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:22:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:22:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:22:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:22:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:22:13,006 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:22:13,007 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:22:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:22:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:22:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:22:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:22:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:22:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:22:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:22:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:22:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:22:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:22:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:22:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:22:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:22:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:22:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:22:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:22:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:22:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:22:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:22:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:22:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:22:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:22:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:22:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:22:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:22:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:22:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:22:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:22:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:22:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:22:15,464 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:22:15,465 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:22:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:22:15 BoogieIcfgContainer [2019-10-02 13:22:15,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:22:15,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:22:15,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:22:15,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:22:15,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:22:11" (1/3) ... [2019-10-02 13:22:15,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b8976e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:22:15, skipping insertion in model container [2019-10-02 13:22:15,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:12" (2/3) ... [2019-10-02 13:22:15,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b8976e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:22:15, skipping insertion in model container [2019-10-02 13:22:15,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:22:15" (3/3) ... [2019-10-02 13:22:15,480 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product32.cil.c [2019-10-02 13:22:15,492 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:22:15,511 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:22:15,531 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:22:15,578 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:22:15,579 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:22:15,579 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:22:15,582 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:22:15,582 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:22:15,582 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:22:15,582 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:22:15,582 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:22:15,583 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:22:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states. [2019-10-02 13:22:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:22:15,669 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:15,674 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:15,678 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1590085758, now seen corresponding path program 1 times [2019-10-02 13:22:15,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:15,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:15,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:16,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:16,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:22:16,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:22:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:22:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:22:16,441 INFO L87 Difference]: Start difference. First operand 649 states. Second operand 2 states. [2019-10-02 13:22:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:16,519 INFO L93 Difference]: Finished difference Result 928 states and 1264 transitions. [2019-10-02 13:22:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:22:16,520 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 204 [2019-10-02 13:22:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:16,544 INFO L225 Difference]: With dead ends: 928 [2019-10-02 13:22:16,544 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 13:22:16,555 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 13:22:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 13:22:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 13:22:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 13:22:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 808 transitions. [2019-10-02 13:22:16,665 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 808 transitions. Word has length 204 [2019-10-02 13:22:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:16,668 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 808 transitions. [2019-10-02 13:22:16,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:22:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 808 transitions. [2019-10-02 13:22:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:22:16,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:16,675 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:16,675 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:16,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1142276697, now seen corresponding path program 1 times [2019-10-02 13:22:16,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:16,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:16,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:16,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:16,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:16,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:16,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:16,994 INFO L87 Difference]: Start difference. First operand 592 states and 808 transitions. Second operand 3 states. [2019-10-02 13:22:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:17,055 INFO L93 Difference]: Finished difference Result 911 states and 1224 transitions. [2019-10-02 13:22:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:17,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 13:22:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:17,061 INFO L225 Difference]: With dead ends: 911 [2019-10-02 13:22:17,062 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 13:22:17,064 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 13:22:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 594. [2019-10-02 13:22:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-02 13:22:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 810 transitions. [2019-10-02 13:22:17,112 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 810 transitions. Word has length 205 [2019-10-02 13:22:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:17,113 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 810 transitions. [2019-10-02 13:22:17,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 810 transitions. [2019-10-02 13:22:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 13:22:17,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:17,118 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:17,119 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:17,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1211358665, now seen corresponding path program 1 times [2019-10-02 13:22:17,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:17,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:17,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:17,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:17,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:17,353 INFO L87 Difference]: Start difference. First operand 594 states and 810 transitions. Second operand 3 states. [2019-10-02 13:22:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:17,397 INFO L93 Difference]: Finished difference Result 1166 states and 1621 transitions. [2019-10-02 13:22:17,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:17,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-02 13:22:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:17,403 INFO L225 Difference]: With dead ends: 1166 [2019-10-02 13:22:17,403 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 13:22:17,405 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 13:22:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 636. [2019-10-02 13:22:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 13:22:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 882 transitions. [2019-10-02 13:22:17,442 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 882 transitions. Word has length 215 [2019-10-02 13:22:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:17,443 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 882 transitions. [2019-10-02 13:22:17,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 882 transitions. [2019-10-02 13:22:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:22:17,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:17,450 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:17,452 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1000729200, now seen corresponding path program 1 times [2019-10-02 13:22:17,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:17,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:17,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:17,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:17,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:17,746 INFO L87 Difference]: Start difference. First operand 636 states and 882 transitions. Second operand 3 states. [2019-10-02 13:22:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:17,805 INFO L93 Difference]: Finished difference Result 1289 states and 1832 transitions. [2019-10-02 13:22:17,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:17,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-02 13:22:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:17,817 INFO L225 Difference]: With dead ends: 1289 [2019-10-02 13:22:17,817 INFO L226 Difference]: Without dead ends: 718 [2019-10-02 13:22:17,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-02 13:22:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 717. [2019-10-02 13:22:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-02 13:22:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1020 transitions. [2019-10-02 13:22:17,871 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1020 transitions. Word has length 216 [2019-10-02 13:22:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:17,872 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1020 transitions. [2019-10-02 13:22:17,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1020 transitions. [2019-10-02 13:22:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 13:22:17,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:17,881 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:17,881 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash -562030519, now seen corresponding path program 1 times [2019-10-02 13:22:17,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:17,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:17,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:17,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:17,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:18,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:18,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:18,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:18,155 INFO L87 Difference]: Start difference. First operand 717 states and 1020 transitions. Second operand 3 states. [2019-10-02 13:22:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:18,202 INFO L93 Difference]: Finished difference Result 1526 states and 2236 transitions. [2019-10-02 13:22:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:18,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-02 13:22:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:18,210 INFO L225 Difference]: With dead ends: 1526 [2019-10-02 13:22:18,211 INFO L226 Difference]: Without dead ends: 874 [2019-10-02 13:22:18,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-02 13:22:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 873. [2019-10-02 13:22:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-10-02 13:22:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1284 transitions. [2019-10-02 13:22:18,260 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1284 transitions. Word has length 217 [2019-10-02 13:22:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:18,261 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1284 transitions. [2019-10-02 13:22:18,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1284 transitions. [2019-10-02 13:22:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:22:18,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:18,267 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:18,267 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1445317616, now seen corresponding path program 1 times [2019-10-02 13:22:18,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:18,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:18,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:18,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:18,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:18,514 INFO L87 Difference]: Start difference. First operand 873 states and 1284 transitions. Second operand 3 states. [2019-10-02 13:22:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:18,576 INFO L93 Difference]: Finished difference Result 1982 states and 3008 transitions. [2019-10-02 13:22:18,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:18,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-02 13:22:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:18,587 INFO L225 Difference]: With dead ends: 1982 [2019-10-02 13:22:18,588 INFO L226 Difference]: Without dead ends: 1174 [2019-10-02 13:22:18,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-10-02 13:22:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1173. [2019-10-02 13:22:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 13:22:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1788 transitions. [2019-10-02 13:22:18,654 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1788 transitions. Word has length 218 [2019-10-02 13:22:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:18,656 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1788 transitions. [2019-10-02 13:22:18,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1788 transitions. [2019-10-02 13:22:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:22:18,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:18,668 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:18,668 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1665385988, now seen corresponding path program 1 times [2019-10-02 13:22:18,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:22:19,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:19,223 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:19,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:19,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 3238 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:20,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:22:20,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:20,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:22:20,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:22:20,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:22:20,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:22:20,405 INFO L87 Difference]: Start difference. First operand 1173 states and 1788 transitions. Second operand 26 states. [2019-10-02 13:22:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:31,763 INFO L93 Difference]: Finished difference Result 4136 states and 6347 transitions. [2019-10-02 13:22:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:22:31,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 221 [2019-10-02 13:22:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:31,785 INFO L225 Difference]: With dead ends: 4136 [2019-10-02 13:22:31,786 INFO L226 Difference]: Without dead ends: 2999 [2019-10-02 13:22:31,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:22:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-10-02 13:22:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2959. [2019-10-02 13:22:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2019-10-02 13:22:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 4513 transitions. [2019-10-02 13:22:31,963 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 4513 transitions. Word has length 221 [2019-10-02 13:22:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:31,963 INFO L475 AbstractCegarLoop]: Abstraction has 2959 states and 4513 transitions. [2019-10-02 13:22:31,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:22:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 4513 transitions. [2019-10-02 13:22:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 13:22:31,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:31,979 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:31,979 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -745786509, now seen corresponding path program 1 times [2019-10-02 13:22:31,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:31,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:31,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:31,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:22:32,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:32,625 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:32,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:33,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 3240 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:22:33,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:22:33,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:22:33,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:22:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:22:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:22:33,541 INFO L87 Difference]: Start difference. First operand 2959 states and 4513 transitions. Second operand 20 states. [2019-10-02 13:22:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:41,957 INFO L93 Difference]: Finished difference Result 5976 states and 9212 transitions. [2019-10-02 13:22:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:22:41,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 223 [2019-10-02 13:22:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:41,978 INFO L225 Difference]: With dead ends: 5976 [2019-10-02 13:22:41,979 INFO L226 Difference]: Without dead ends: 3068 [2019-10-02 13:22:41,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:22:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2019-10-02 13:22:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3033. [2019-10-02 13:22:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3033 states. [2019-10-02 13:22:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 4635 transitions. [2019-10-02 13:22:42,140 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 4635 transitions. Word has length 223 [2019-10-02 13:22:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:42,140 INFO L475 AbstractCegarLoop]: Abstraction has 3033 states and 4635 transitions. [2019-10-02 13:22:42,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:22:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 4635 transitions. [2019-10-02 13:22:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:22:42,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:42,156 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:42,156 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash 229246666, now seen corresponding path program 1 times [2019-10-02 13:22:42,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:42,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:22:42,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:42,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:22:42,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:22:42,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:22:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:42,628 INFO L87 Difference]: Start difference. First operand 3033 states and 4635 transitions. Second operand 18 states. [2019-10-02 13:22:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:43,327 INFO L93 Difference]: Finished difference Result 4569 states and 6830 transitions. [2019-10-02 13:22:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:22:43,328 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 224 [2019-10-02 13:22:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:43,359 INFO L225 Difference]: With dead ends: 4569 [2019-10-02 13:22:43,359 INFO L226 Difference]: Without dead ends: 3223 [2019-10-02 13:22:43,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:22:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2019-10-02 13:22:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3223. [2019-10-02 13:22:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3223 states. [2019-10-02 13:22:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4913 transitions. [2019-10-02 13:22:43,573 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4913 transitions. Word has length 224 [2019-10-02 13:22:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:43,574 INFO L475 AbstractCegarLoop]: Abstraction has 3223 states and 4913 transitions. [2019-10-02 13:22:43,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:22:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4913 transitions. [2019-10-02 13:22:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:22:43,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:43,597 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:43,598 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash 713176534, now seen corresponding path program 1 times [2019-10-02 13:22:43,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:43,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:43,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:43,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:43,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:43,943 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 13:22:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:44,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 3241 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:44,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:22:44,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:44,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:22:44,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:22:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:22:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:22:44,657 INFO L87 Difference]: Start difference. First operand 3223 states and 4913 transitions. Second operand 12 states. [2019-10-02 13:22:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:51,004 INFO L93 Difference]: Finished difference Result 9457 states and 14534 transitions. [2019-10-02 13:22:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:22:51,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 224 [2019-10-02 13:22:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:51,046 INFO L225 Difference]: With dead ends: 9457 [2019-10-02 13:22:51,047 INFO L226 Difference]: Without dead ends: 6295 [2019-10-02 13:22:51,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 226 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 13:22:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2019-10-02 13:22:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 6275. [2019-10-02 13:22:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6275 states. [2019-10-02 13:22:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 9583 transitions. [2019-10-02 13:22:51,362 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 9583 transitions. Word has length 224 [2019-10-02 13:22:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:51,363 INFO L475 AbstractCegarLoop]: Abstraction has 6275 states and 9583 transitions. [2019-10-02 13:22:51,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:22:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 9583 transitions. [2019-10-02 13:22:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 13:22:51,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:51,382 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:51,383 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash -719111475, now seen corresponding path program 1 times [2019-10-02 13:22:51,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:51,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:51,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:51,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:22:51,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:51,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:22:51,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:22:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:22:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:22:51,787 INFO L87 Difference]: Start difference. First operand 6275 states and 9583 transitions. Second operand 12 states. [2019-10-02 13:23:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:06,990 INFO L93 Difference]: Finished difference Result 37125 states and 57060 transitions. [2019-10-02 13:23:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:23:06,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 225 [2019-10-02 13:23:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:07,264 INFO L225 Difference]: With dead ends: 37125 [2019-10-02 13:23:07,264 INFO L226 Difference]: Without dead ends: 33471 [2019-10-02 13:23:07,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 13:23:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33471 states. [2019-10-02 13:23:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33471 to 33233. [2019-10-02 13:23:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33233 states. [2019-10-02 13:23:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33233 states to 33233 states and 50539 transitions. [2019-10-02 13:23:09,505 INFO L78 Accepts]: Start accepts. Automaton has 33233 states and 50539 transitions. Word has length 225 [2019-10-02 13:23:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:09,505 INFO L475 AbstractCegarLoop]: Abstraction has 33233 states and 50539 transitions. [2019-10-02 13:23:09,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:23:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33233 states and 50539 transitions. [2019-10-02 13:23:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 13:23:09,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:09,535 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:09,535 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash 324664343, now seen corresponding path program 1 times [2019-10-02 13:23:09,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:09,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:09,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:09,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:23:09,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-02 13:23:09,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:23:09,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:23:09,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:23:09,955 INFO L87 Difference]: Start difference. First operand 33233 states and 50539 transitions. Second operand 20 states. [2019-10-02 13:23:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:11,088 INFO L93 Difference]: Finished difference Result 58953 states and 88682 transitions. [2019-10-02 13:23:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 13:23:11,088 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 226 [2019-10-02 13:23:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:11,246 INFO L225 Difference]: With dead ends: 58953 [2019-10-02 13:23:11,246 INFO L226 Difference]: Without dead ends: 28865 [2019-10-02 13:23:11,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:23:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28865 states. [2019-10-02 13:23:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28865 to 28759. [2019-10-02 13:23:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28759 states. [2019-10-02 13:23:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28759 states to 28759 states and 42284 transitions. [2019-10-02 13:23:14,144 INFO L78 Accepts]: Start accepts. Automaton has 28759 states and 42284 transitions. Word has length 226 [2019-10-02 13:23:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:14,146 INFO L475 AbstractCegarLoop]: Abstraction has 28759 states and 42284 transitions. [2019-10-02 13:23:14,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:23:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28759 states and 42284 transitions. [2019-10-02 13:23:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:23:14,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:14,169 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:14,170 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash 373266558, now seen corresponding path program 1 times [2019-10-02 13:23:14,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:14,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:23:14,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:14,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:23:14,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:23:14,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:23:14,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:23:14,382 INFO L87 Difference]: Start difference. First operand 28759 states and 42284 transitions. Second operand 8 states. [2019-10-02 13:23:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:16,561 INFO L93 Difference]: Finished difference Result 81887 states and 122098 transitions. [2019-10-02 13:23:16,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:23:16,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2019-10-02 13:23:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:16,816 INFO L225 Difference]: With dead ends: 81887 [2019-10-02 13:23:16,816 INFO L226 Difference]: Without dead ends: 56937 [2019-10-02 13:23:16,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56937 states. [2019-10-02 13:23:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56937 to 55511. [2019-10-02 13:23:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55511 states. [2019-10-02 13:23:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55511 states to 55511 states and 81024 transitions. [2019-10-02 13:23:21,296 INFO L78 Accepts]: Start accepts. Automaton has 55511 states and 81024 transitions. Word has length 235 [2019-10-02 13:23:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:21,296 INFO L475 AbstractCegarLoop]: Abstraction has 55511 states and 81024 transitions. [2019-10-02 13:23:21,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:23:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 55511 states and 81024 transitions. [2019-10-02 13:23:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:23:21,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:21,326 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:21,327 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 562060617, now seen corresponding path program 1 times [2019-10-02 13:23:21,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:21,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:21,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:23:21,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:21,599 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 13:23:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:22,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:23:22,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:23:22,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:22,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:23:22,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:23:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:23:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:23:22,439 INFO L87 Difference]: Start difference. First operand 55511 states and 81024 transitions. Second operand 22 states. [2019-10-02 13:23:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:32,944 INFO L93 Difference]: Finished difference Result 111989 states and 167770 transitions. [2019-10-02 13:23:32,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:23:32,945 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 236 [2019-10-02 13:23:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:33,162 INFO L225 Difference]: With dead ends: 111989 [2019-10-02 13:23:33,163 INFO L226 Difference]: Without dead ends: 56553 [2019-10-02 13:23:33,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 13:23:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56553 states. [2019-10-02 13:23:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56553 to 55511. [2019-10-02 13:23:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55511 states. [2019-10-02 13:23:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55511 states to 55511 states and 81023 transitions. [2019-10-02 13:23:35,356 INFO L78 Accepts]: Start accepts. Automaton has 55511 states and 81023 transitions. Word has length 236 [2019-10-02 13:23:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:35,357 INFO L475 AbstractCegarLoop]: Abstraction has 55511 states and 81023 transitions. [2019-10-02 13:23:35,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:23:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 55511 states and 81023 transitions. [2019-10-02 13:23:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:23:35,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:35,386 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:35,387 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1303898587, now seen corresponding path program 1 times [2019-10-02 13:23:35,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:35,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:23:35,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:35,829 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 13:23:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:36,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:23:36,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:23:36,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:36,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-10-02 13:23:36,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:23:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:23:36,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:23:36,667 INFO L87 Difference]: Start difference. First operand 55511 states and 81023 transitions. Second operand 30 states. [2019-10-02 13:23:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:48,764 INFO L93 Difference]: Finished difference Result 115610 states and 171836 transitions. [2019-10-02 13:23:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 13:23:48,765 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 237 [2019-10-02 13:23:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:48,971 INFO L225 Difference]: With dead ends: 115610 [2019-10-02 13:23:48,971 INFO L226 Difference]: Without dead ends: 60179 [2019-10-02 13:23:49,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=659, Invalid=7351, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 13:23:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60179 states. [2019-10-02 13:23:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60179 to 58783. [2019-10-02 13:23:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58783 states. [2019-10-02 13:23:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58783 states to 58783 states and 85984 transitions. [2019-10-02 13:23:51,384 INFO L78 Accepts]: Start accepts. Automaton has 58783 states and 85984 transitions. Word has length 237 [2019-10-02 13:23:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:51,384 INFO L475 AbstractCegarLoop]: Abstraction has 58783 states and 85984 transitions. [2019-10-02 13:23:51,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:23:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 58783 states and 85984 transitions. [2019-10-02 13:23:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:23:51,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:51,401 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:51,401 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 814789040, now seen corresponding path program 1 times [2019-10-02 13:23:51,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:51,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:23:51,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:23:51,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:23:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:23:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:51,667 INFO L87 Difference]: Start difference. First operand 58783 states and 85984 transitions. Second operand 13 states. [2019-10-02 13:23:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:55,739 INFO L93 Difference]: Finished difference Result 110941 states and 165163 transitions. [2019-10-02 13:23:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:23:55,739 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2019-10-02 13:23:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:55,933 INFO L225 Difference]: With dead ends: 110941 [2019-10-02 13:23:55,933 INFO L226 Difference]: Without dead ends: 67759 [2019-10-02 13:23:55,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:23:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67759 states. [2019-10-02 13:23:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67759 to 65917. [2019-10-02 13:23:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65917 states. [2019-10-02 13:23:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65917 states to 65917 states and 97939 transitions. [2019-10-02 13:23:58,159 INFO L78 Accepts]: Start accepts. Automaton has 65917 states and 97939 transitions. Word has length 238 [2019-10-02 13:23:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:58,159 INFO L475 AbstractCegarLoop]: Abstraction has 65917 states and 97939 transitions. [2019-10-02 13:23:58,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:23:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 65917 states and 97939 transitions. [2019-10-02 13:23:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:23:58,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:58,174 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:58,174 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash -462495706, now seen corresponding path program 2 times [2019-10-02 13:23:58,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:58,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:58,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:58,379 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 13:23:58,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:23:59,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:23:59,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:23:59,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 13:23:59,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:23:59,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:23:59,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:23:59,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:23:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:23:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:23:59,358 INFO L87 Difference]: Start difference. First operand 65917 states and 97939 transitions. Second operand 18 states. [2019-10-02 13:24:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:14,549 INFO L93 Difference]: Finished difference Result 187971 states and 280465 transitions. [2019-10-02 13:24:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:24:14,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2019-10-02 13:24:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:14,914 INFO L225 Difference]: With dead ends: 187971 [2019-10-02 13:24:14,915 INFO L226 Difference]: Without dead ends: 119275 [2019-10-02 13:24:15,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:24:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119275 states. [2019-10-02 13:24:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119275 to 108956. [2019-10-02 13:24:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108956 states. [2019-10-02 13:24:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108956 states to 108956 states and 160241 transitions. [2019-10-02 13:24:19,200 INFO L78 Accepts]: Start accepts. Automaton has 108956 states and 160241 transitions. Word has length 238 [2019-10-02 13:24:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:19,201 INFO L475 AbstractCegarLoop]: Abstraction has 108956 states and 160241 transitions. [2019-10-02 13:24:19,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:24:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 108956 states and 160241 transitions. [2019-10-02 13:24:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 13:24:19,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:19,237 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:19,238 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1405871471, now seen corresponding path program 1 times [2019-10-02 13:24:19,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:19,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:24:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:24:19,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:19,804 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 13:24:19,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:20,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:24:20,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:24:20,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:24:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 33 [2019-10-02 13:24:20,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 13:24:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 13:24:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:24:20,621 INFO L87 Difference]: Start difference. First operand 108956 states and 160241 transitions. Second operand 33 states. [2019-10-02 13:24:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:34,943 INFO L93 Difference]: Finished difference Result 218714 states and 322018 transitions. [2019-10-02 13:24:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:24:34,943 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 239 [2019-10-02 13:24:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:35,313 INFO L225 Difference]: With dead ends: 218714 [2019-10-02 13:24:35,313 INFO L226 Difference]: Without dead ends: 109868 [2019-10-02 13:24:35,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=393, Invalid=3767, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 13:24:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109868 states. [2019-10-02 13:24:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109868 to 109047. [2019-10-02 13:24:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109047 states. [2019-10-02 13:24:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109047 states to 109047 states and 160523 transitions. [2019-10-02 13:24:43,247 INFO L78 Accepts]: Start accepts. Automaton has 109047 states and 160523 transitions. Word has length 239 [2019-10-02 13:24:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:43,247 INFO L475 AbstractCegarLoop]: Abstraction has 109047 states and 160523 transitions. [2019-10-02 13:24:43,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 13:24:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 109047 states and 160523 transitions. [2019-10-02 13:24:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:24:43,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:43,279 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:43,279 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash -897921751, now seen corresponding path program 1 times [2019-10-02 13:24:43,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:43,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:43,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:43,415 INFO L87 Difference]: Start difference. First operand 109047 states and 160523 transitions. Second operand 3 states. [2019-10-02 13:24:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:46,820 INFO L93 Difference]: Finished difference Result 221416 states and 327230 transitions. [2019-10-02 13:24:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:46,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-10-02 13:24:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:47,223 INFO L225 Difference]: With dead ends: 221416 [2019-10-02 13:24:47,223 INFO L226 Difference]: Without dead ends: 112509 [2019-10-02 13:24:47,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112509 states. [2019-10-02 13:24:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112509 to 109754. [2019-10-02 13:24:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109754 states. [2019-10-02 13:24:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109754 states to 109754 states and 162730 transitions. [2019-10-02 13:24:55,017 INFO L78 Accepts]: Start accepts. Automaton has 109754 states and 162730 transitions. Word has length 238 [2019-10-02 13:24:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:55,017 INFO L475 AbstractCegarLoop]: Abstraction has 109754 states and 162730 transitions. [2019-10-02 13:24:55,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 109754 states and 162730 transitions. [2019-10-02 13:24:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:24:55,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:55,055 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:55,055 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash -647048574, now seen corresponding path program 1 times [2019-10-02 13:24:55,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:55,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:55,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:24:55,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:55,375 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 13:24:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:56,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:24:56,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:56,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:24:56,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 20 [2019-10-02 13:24:56,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:24:56,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:24:56,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:24:56,103 INFO L87 Difference]: Start difference. First operand 109754 states and 162730 transitions. Second operand 20 states. [2019-10-02 13:25:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:09,915 INFO L93 Difference]: Finished difference Result 239029 states and 352608 transitions. [2019-10-02 13:25:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 13:25:09,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 241 [2019-10-02 13:25:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:10,358 INFO L225 Difference]: With dead ends: 239029 [2019-10-02 13:25:10,358 INFO L226 Difference]: Without dead ends: 137669 [2019-10-02 13:25:10,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 13:25:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137669 states. [2019-10-02 13:25:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137669 to 136532. [2019-10-02 13:25:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136532 states. [2019-10-02 13:25:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136532 states to 136532 states and 202095 transitions. [2019-10-02 13:25:15,673 INFO L78 Accepts]: Start accepts. Automaton has 136532 states and 202095 transitions. Word has length 241 [2019-10-02 13:25:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:15,674 INFO L475 AbstractCegarLoop]: Abstraction has 136532 states and 202095 transitions. [2019-10-02 13:25:15,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:25:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 136532 states and 202095 transitions. [2019-10-02 13:25:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:25:15,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:15,714 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:15,714 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1664113358, now seen corresponding path program 1 times [2019-10-02 13:25:15,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:15,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:15,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:15,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:15,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:15,854 INFO L87 Difference]: Start difference. First operand 136532 states and 202095 transitions. Second operand 3 states. [2019-10-02 13:25:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:21,077 INFO L93 Difference]: Finished difference Result 279840 states and 416672 transitions. [2019-10-02 13:25:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:25:21,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-02 13:25:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:21,536 INFO L225 Difference]: With dead ends: 279840 [2019-10-02 13:25:21,536 INFO L226 Difference]: Without dead ends: 143550 [2019-10-02 13:25:21,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143550 states. [2019-10-02 13:25:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143550 to 143544. [2019-10-02 13:25:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143544 states. [2019-10-02 13:25:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143544 states to 143544 states and 214673 transitions. [2019-10-02 13:25:32,226 INFO L78 Accepts]: Start accepts. Automaton has 143544 states and 214673 transitions. Word has length 241 [2019-10-02 13:25:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:32,226 INFO L475 AbstractCegarLoop]: Abstraction has 143544 states and 214673 transitions. [2019-10-02 13:25:32,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:25:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 143544 states and 214673 transitions. [2019-10-02 13:25:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:25:32,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:32,292 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:32,293 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1620702251, now seen corresponding path program 1 times [2019-10-02 13:25:32,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:32,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:32,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:32,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:32,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:32,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:32,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:32,425 INFO L87 Difference]: Start difference. First operand 143544 states and 214673 transitions. Second operand 3 states. [2019-10-02 13:25:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:40,111 INFO L93 Difference]: Finished difference Result 299900 states and 452466 transitions. [2019-10-02 13:25:40,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:25:40,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-10-02 13:25:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:40,652 INFO L225 Difference]: With dead ends: 299900 [2019-10-02 13:25:40,652 INFO L226 Difference]: Without dead ends: 156610 [2019-10-02 13:25:40,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156610 states. [2019-10-02 13:25:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156610 to 156433. [2019-10-02 13:25:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156433 states. [2019-10-02 13:25:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156433 states to 156433 states and 237488 transitions. [2019-10-02 13:25:47,946 INFO L78 Accepts]: Start accepts. Automaton has 156433 states and 237488 transitions. Word has length 242 [2019-10-02 13:25:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:47,946 INFO L475 AbstractCegarLoop]: Abstraction has 156433 states and 237488 transitions. [2019-10-02 13:25:47,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:25:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 156433 states and 237488 transitions. [2019-10-02 13:25:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:25:48,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:48,084 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:48,084 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1451039756, now seen corresponding path program 1 times [2019-10-02 13:25:48,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:48,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:48,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:48,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:48,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:48,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:48,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:48,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:48,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:48,217 INFO L87 Difference]: Start difference. First operand 156433 states and 237488 transitions. Second operand 3 states. [2019-10-02 13:25:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:58,195 INFO L93 Difference]: Finished difference Result 337570 states and 519584 transitions. [2019-10-02 13:25:58,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:25:58,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-10-02 13:25:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:58,890 INFO L225 Difference]: With dead ends: 337570 [2019-10-02 13:25:58,890 INFO L226 Difference]: Without dead ends: 181403 [2019-10-02 13:25:59,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181403 states. [2019-10-02 13:26:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181403 to 181364. [2019-10-02 13:26:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181364 states. [2019-10-02 13:26:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181364 states to 181364 states and 281609 transitions. [2019-10-02 13:26:07,210 INFO L78 Accepts]: Start accepts. Automaton has 181364 states and 281609 transitions. Word has length 243 [2019-10-02 13:26:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:07,211 INFO L475 AbstractCegarLoop]: Abstraction has 181364 states and 281609 transitions. [2019-10-02 13:26:07,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 181364 states and 281609 transitions. [2019-10-02 13:26:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 13:26:07,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:07,445 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:07,446 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash 705084949, now seen corresponding path program 1 times [2019-10-02 13:26:07,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:07,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:07,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:26:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:07,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:07,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:07,582 INFO L87 Difference]: Start difference. First operand 181364 states and 281609 transitions. Second operand 3 states. [2019-10-02 13:26:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:19,368 INFO L93 Difference]: Finished difference Result 410080 states and 646594 transitions. [2019-10-02 13:26:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:19,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-02 13:26:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:20,088 INFO L225 Difference]: With dead ends: 410080 [2019-10-02 13:26:20,088 INFO L226 Difference]: Without dead ends: 228998 [2019-10-02 13:26:20,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228998 states. [2019-10-02 13:26:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228998 to 228992. [2019-10-02 13:26:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228992 states. [2019-10-02 13:26:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228992 states to 228992 states and 363795 transitions. [2019-10-02 13:26:39,195 INFO L78 Accepts]: Start accepts. Automaton has 228992 states and 363795 transitions. Word has length 244 [2019-10-02 13:26:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:39,196 INFO L475 AbstractCegarLoop]: Abstraction has 228992 states and 363795 transitions. [2019-10-02 13:26:39,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 228992 states and 363795 transitions. [2019-10-02 13:26:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 13:26:39,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:39,642 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:39,643 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash -27710028, now seen corresponding path program 1 times [2019-10-02 13:26:39,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:39,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:39,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:39,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:26:39,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:26:39,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:26:39,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:26:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:26:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:39,772 INFO L87 Difference]: Start difference. First operand 228992 states and 363795 transitions. Second operand 3 states. [2019-10-02 13:26:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:56,201 INFO L93 Difference]: Finished difference Result 548316 states and 883892 transitions. [2019-10-02 13:26:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:56,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-02 13:26:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:57,158 INFO L225 Difference]: With dead ends: 548316 [2019-10-02 13:26:57,158 INFO L226 Difference]: Without dead ends: 319626 [2019-10-02 13:26:57,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319626 states. [2019-10-02 13:27:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319626 to 319620. [2019-10-02 13:27:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319620 states. [2019-10-02 13:27:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319620 states to 319620 states and 517397 transitions. [2019-10-02 13:27:23,112 INFO L78 Accepts]: Start accepts. Automaton has 319620 states and 517397 transitions. Word has length 245 [2019-10-02 13:27:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:27:23,112 INFO L475 AbstractCegarLoop]: Abstraction has 319620 states and 517397 transitions. [2019-10-02 13:27:23,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:27:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 319620 states and 517397 transitions. [2019-10-02 13:27:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 13:27:23,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:27:23,894 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:27:23,894 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:27:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:27:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1538422869, now seen corresponding path program 1 times [2019-10-02 13:27:23,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:27:23,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:27:23,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:23,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:27:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:27:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:27:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:27:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:27:24,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:27:24,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:27:24,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:27:24,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:24,023 INFO L87 Difference]: Start difference. First operand 319620 states and 517397 transitions. Second operand 3 states. [2019-10-02 13:27:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:50,188 INFO L93 Difference]: Finished difference Result 619406 states and 995931 transitions. [2019-10-02 13:27:50,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:27:50,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-02 13:27:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:51,731 INFO L225 Difference]: With dead ends: 619406 [2019-10-02 13:27:51,731 INFO L226 Difference]: Without dead ends: 491634 [2019-10-02 13:27:53,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:27:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491634 states. [2019-10-02 13:28:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491634 to 491628. [2019-10-02 13:28:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491628 states. [2019-10-02 13:28:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491628 states to 491628 states and 803061 transitions. [2019-10-02 13:28:38,258 INFO L78 Accepts]: Start accepts. Automaton has 491628 states and 803061 transitions. Word has length 246 [2019-10-02 13:28:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:38,258 INFO L475 AbstractCegarLoop]: Abstraction has 491628 states and 803061 transitions. [2019-10-02 13:28:38,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 491628 states and 803061 transitions. [2019-10-02 13:28:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:28:39,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:39,498 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:28:39,499 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1776128140, now seen corresponding path program 1 times [2019-10-02 13:28:39,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:39,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:39,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:28:39,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:39,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:28:39,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:28:39,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:28:39,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:28:39,717 INFO L87 Difference]: Start difference. First operand 491628 states and 803061 transitions. Second operand 13 states. [2019-10-02 13:29:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:29:10,480 INFO L93 Difference]: Finished difference Result 604796 states and 975230 transitions. [2019-10-02 13:29:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:29:10,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 247 [2019-10-02 13:29:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:29:12,132 INFO L225 Difference]: With dead ends: 604796 [2019-10-02 13:29:12,132 INFO L226 Difference]: Without dead ends: 509418 [2019-10-02 13:29:12,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:29:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509418 states. [2019-10-02 13:29:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509418 to 508024. [2019-10-02 13:29:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508024 states. [2019-10-02 13:29:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508024 states to 508024 states and 830423 transitions. [2019-10-02 13:29:57,681 INFO L78 Accepts]: Start accepts. Automaton has 508024 states and 830423 transitions. Word has length 247 [2019-10-02 13:29:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:29:57,682 INFO L475 AbstractCegarLoop]: Abstraction has 508024 states and 830423 transitions. [2019-10-02 13:29:57,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:29:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 508024 states and 830423 transitions. [2019-10-02 13:29:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:29:59,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:29:59,111 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:29:59,112 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:29:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:29:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 923250955, now seen corresponding path program 1 times [2019-10-02 13:29:59,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:29:59,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:29:59,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:59,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:29:59,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:29:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:29:59,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:29:59,587 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 13:29:59,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:00,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 3314 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 13:30:00,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:30:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:30:01,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:30:01,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-10-02 13:30:01,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 13:30:01,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 13:30:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:30:01,759 INFO L87 Difference]: Start difference. First operand 508024 states and 830423 transitions. Second operand 35 states.