java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec9_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:53:40,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:53:40,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:53:40,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:53:40,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:53:40,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:53:40,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:53:40,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:53:40,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:53:40,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:53:40,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:53:40,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:53:40,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:53:40,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:53:40,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:53:40,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:53:40,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:53:40,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:53:40,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:53:40,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:53:40,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:53:40,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:53:40,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:53:40,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:53:40,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:53:40,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:53:40,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:53:40,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:53:40,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:53:40,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:53:40,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:53:40,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:53:40,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:53:40,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:53:40,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:53:40,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:53:40,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:53:40,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:53:40,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:53:40,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:53:40,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:53:40,370 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-09-08 05:53:40,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:53:40,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:53:40,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:53:40,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:53:40,392 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:53:40,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:53:40,392 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:53:40,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:53:40,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:53:40,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:53:40,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:53:40,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:53:40,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:53:40,394 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:53:40,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:53:40,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:53:40,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:53:40,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:53:40,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:53:40,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:53:40,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:53:40,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:53:40,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:53:40,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:53:40,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:53:40,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:53:40,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:53:40,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:53:40,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:53:40,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:53:40,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:53:40,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:53:40,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:53:40,460 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:53:40,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product20.cil.c [2019-09-08 05:53:40,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdef3ff63/7790b7a278e14bb5ad3d8fced95fd297/FLAGb5211f67b [2019-09-08 05:53:41,160 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:53:41,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product20.cil.c [2019-09-08 05:53:41,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdef3ff63/7790b7a278e14bb5ad3d8fced95fd297/FLAGb5211f67b [2019-09-08 05:53:41,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdef3ff63/7790b7a278e14bb5ad3d8fced95fd297 [2019-09-08 05:53:41,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:53:41,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:53:41,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:53:41,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:53:41,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:53:41,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:53:41" (1/1) ... [2019-09-08 05:53:41,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:41, skipping insertion in model container [2019-09-08 05:53:41,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:53:41" (1/1) ... [2019-09-08 05:53:41,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:53:41,475 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:53:42,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:53:42,195 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:53:42,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:53:42,474 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:53:42,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42 WrapperNode [2019-09-08 05:53:42,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:53:42,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:53:42,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:53:42,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:53:42,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (1/1) ... [2019-09-08 05:53:42,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:53:42,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:53:42,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:53:42,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:53:42,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (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-09-08 05:53:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:53:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:53:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:53:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:53:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:53:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:53:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:53:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:53:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:53:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:53:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:53:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:53:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:53:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:53:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:53:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:53:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:53:42,731 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:53:42,732 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:53:42,732 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:53:42,732 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:53:42,734 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:53:42,734 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:53:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:53:42,736 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:53:42,736 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:53:42,736 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:53:42,736 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:53:42,737 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:53:42,737 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:53:42,737 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:53:42,737 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:53:42,737 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:53:42,737 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:53:42,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:53:42,738 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:53:42,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:53:42,739 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:53:42,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:53:42,739 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:53:42,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:53:42,739 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:53:42,740 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:53:42,740 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:53:42,740 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:53:42,740 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:53:42,740 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:53:42,740 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:53:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:53:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:53:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:53:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:53:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:53:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:53:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:53:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:53:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:53:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:53:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:53:42,743 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:53:42,743 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:53:42,743 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:53:42,743 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:53:42,744 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:53:42,744 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:53:42,744 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:53:42,744 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:53:42,744 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:53:42,745 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:53:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:53:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:53:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 05:53:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:53:42,746 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:53:42,747 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:53:42,747 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:53:42,748 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:53:42,748 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:53:42,748 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:53:42,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:53:42,749 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:53:42,750 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:53:42,750 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:53:42,750 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:53:42,750 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:53:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:53:42,751 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:53:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:53:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:53:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:53:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:53:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:53:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:53:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:53:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:53:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:53:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:53:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:53:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:53:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:53:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:53:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:53:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:53:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:53:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:53:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:53:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:53:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:53:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:53:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:53:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:53:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:53:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:53:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:53:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:53:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:53:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:53:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:53:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:53:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:53:42,758 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:53:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:53:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:53:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:53:42,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:53:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:53:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:53:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:53:42,760 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:53:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:53:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:53:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:53:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:53:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:53:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:53:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:53:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:53:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:53:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:53:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:53:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:53:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:53:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:53:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:53:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:53:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:53:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:53:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:53:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:53:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:53:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:53:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:53:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:53:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:53:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:53:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:53:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:53:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:53:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:53:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:53:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:53:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:53:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:53:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:53:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:53:45,023 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:53:45,023 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:53:45,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:53:45 BoogieIcfgContainer [2019-09-08 05:53:45,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:53:45,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:53:45,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:53:45,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:53:45,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:53:41" (1/3) ... [2019-09-08 05:53:45,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3459bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:53:45, skipping insertion in model container [2019-09-08 05:53:45,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:53:42" (2/3) ... [2019-09-08 05:53:45,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3459bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:53:45, skipping insertion in model container [2019-09-08 05:53:45,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:53:45" (3/3) ... [2019-09-08 05:53:45,036 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product20.cil.c [2019-09-08 05:53:45,047 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:53:45,059 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:53:45,077 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:53:45,114 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:53:45,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:53:45,114 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:53:45,115 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:53:45,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:53:45,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:53:45,115 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:53:45,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:53:45,115 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:53:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states. [2019-09-08 05:53:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 05:53:45,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:45,172 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:45,175 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1483923005, now seen corresponding path program 1 times [2019-09-08 05:53:45,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:45,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:53:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:53:45,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:53:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:53:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:53:45,803 INFO L87 Difference]: Start difference. First operand 563 states. Second operand 2 states. [2019-09-08 05:53:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:45,887 INFO L93 Difference]: Finished difference Result 764 states and 1044 transitions. [2019-09-08 05:53:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:53:45,889 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-09-08 05:53:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:45,913 INFO L225 Difference]: With dead ends: 764 [2019-09-08 05:53:45,913 INFO L226 Difference]: Without dead ends: 510 [2019-09-08 05:53:45,921 INFO L628 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-09-08 05:53:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-08 05:53:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2019-09-08 05:53:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-09-08 05:53:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 701 transitions. [2019-09-08 05:53:46,130 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 701 transitions. Word has length 154 [2019-09-08 05:53:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:46,133 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 701 transitions. [2019-09-08 05:53:46,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:53:46,133 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 701 transitions. [2019-09-08 05:53:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 05:53:46,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:46,142 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:46,142 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:46,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1309919830, now seen corresponding path program 1 times [2019-09-08 05:53:46,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:46,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:46,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:53:46,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:46,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:46,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:46,455 INFO L87 Difference]: Start difference. First operand 510 states and 701 transitions. Second operand 3 states. [2019-09-08 05:53:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:46,525 INFO L93 Difference]: Finished difference Result 747 states and 1010 transitions. [2019-09-08 05:53:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 05:53:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:46,535 INFO L225 Difference]: With dead ends: 747 [2019-09-08 05:53:46,535 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 05:53:46,540 INFO L628 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-09-08 05:53:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 05:53:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-09-08 05:53:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 05:53:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 703 transitions. [2019-09-08 05:53:46,576 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 703 transitions. Word has length 155 [2019-09-08 05:53:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:46,577 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 703 transitions. [2019-09-08 05:53:46,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 703 transitions. [2019-09-08 05:53:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:53:46,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:46,582 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:46,582 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:46,583 INFO L82 PathProgramCache]: Analyzing trace with hash 406210246, now seen corresponding path program 1 times [2019-09-08 05:53:46,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:46,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:46,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:46,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:53:46,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:46,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:46,754 INFO L87 Difference]: Start difference. First operand 512 states and 703 transitions. Second operand 3 states. [2019-09-08 05:53:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:46,794 INFO L93 Difference]: Finished difference Result 1002 states and 1407 transitions. [2019-09-08 05:53:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:46,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 05:53:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:46,800 INFO L225 Difference]: With dead ends: 1002 [2019-09-08 05:53:46,801 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 05:53:46,803 INFO L628 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-09-08 05:53:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 05:53:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2019-09-08 05:53:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-08 05:53:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 775 transitions. [2019-09-08 05:53:46,856 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 775 transitions. Word has length 165 [2019-09-08 05:53:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:46,859 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 775 transitions. [2019-09-08 05:53:46,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 775 transitions. [2019-09-08 05:53:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:53:46,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:46,868 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:46,868 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1441612235, now seen corresponding path program 1 times [2019-09-08 05:53:46,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:46,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:46,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:53:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:47,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:47,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:47,137 INFO L87 Difference]: Start difference. First operand 554 states and 775 transitions. Second operand 3 states. [2019-09-08 05:53:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:47,175 INFO L93 Difference]: Finished difference Result 1125 states and 1618 transitions. [2019-09-08 05:53:47,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:47,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 05:53:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:47,181 INFO L225 Difference]: With dead ends: 1125 [2019-09-08 05:53:47,182 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 05:53:47,184 INFO L628 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-09-08 05:53:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 05:53:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 635. [2019-09-08 05:53:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-08 05:53:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 913 transitions. [2019-09-08 05:53:47,214 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 913 transitions. Word has length 166 [2019-09-08 05:53:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:47,215 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 913 transitions. [2019-09-08 05:53:47,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 913 transitions. [2019-09-08 05:53:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:53:47,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:47,220 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:47,220 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1339391418, now seen corresponding path program 1 times [2019-09-08 05:53:47,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:47,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:47,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:53:47,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:47,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:47,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:47,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:47,362 INFO L87 Difference]: Start difference. First operand 635 states and 913 transitions. Second operand 3 states. [2019-09-08 05:53:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:47,407 INFO L93 Difference]: Finished difference Result 1362 states and 2022 transitions. [2019-09-08 05:53:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:47,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 05:53:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:47,414 INFO L225 Difference]: With dead ends: 1362 [2019-09-08 05:53:47,414 INFO L226 Difference]: Without dead ends: 792 [2019-09-08 05:53:47,417 INFO L628 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-09-08 05:53:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-08 05:53:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2019-09-08 05:53:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-09-08 05:53:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1177 transitions. [2019-09-08 05:53:47,456 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1177 transitions. Word has length 167 [2019-09-08 05:53:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:47,456 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1177 transitions. [2019-09-08 05:53:47,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1177 transitions. [2019-09-08 05:53:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:53:47,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:47,462 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:47,462 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 771079861, now seen corresponding path program 1 times [2019-09-08 05:53:47,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:47,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:53:47,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:47,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:47,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:47,630 INFO L87 Difference]: Start difference. First operand 791 states and 1177 transitions. Second operand 3 states. [2019-09-08 05:53:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:47,725 INFO L93 Difference]: Finished difference Result 1818 states and 2794 transitions. [2019-09-08 05:53:47,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:47,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:53:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:47,733 INFO L225 Difference]: With dead ends: 1818 [2019-09-08 05:53:47,733 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 05:53:47,736 INFO L628 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-09-08 05:53:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 05:53:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1091. [2019-09-08 05:53:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-09-08 05:53:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1681 transitions. [2019-09-08 05:53:47,788 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1681 transitions. Word has length 168 [2019-09-08 05:53:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:47,791 INFO L475 AbstractCegarLoop]: Abstraction has 1091 states and 1681 transitions. [2019-09-08 05:53:47,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1681 transitions. [2019-09-08 05:53:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 05:53:47,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:47,799 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:47,799 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:47,799 INFO L82 PathProgramCache]: Analyzing trace with hash -846644512, now seen corresponding path program 1 times [2019-09-08 05:53:47,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:47,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:53:47,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:47,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:53:47,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:53:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:53:47,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:47,996 INFO L87 Difference]: Start difference. First operand 1091 states and 1681 transitions. Second operand 3 states. [2019-09-08 05:53:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:48,055 INFO L93 Difference]: Finished difference Result 1426 states and 2141 transitions. [2019-09-08 05:53:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:53:48,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 05:53:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:48,066 INFO L225 Difference]: With dead ends: 1426 [2019-09-08 05:53:48,066 INFO L226 Difference]: Without dead ends: 1205 [2019-09-08 05:53:48,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:53:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-09-08 05:53:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1204. [2019-09-08 05:53:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-09-08 05:53:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1843 transitions. [2019-09-08 05:53:48,135 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1843 transitions. Word has length 171 [2019-09-08 05:53:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:48,136 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1843 transitions. [2019-09-08 05:53:48,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:53:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1843 transitions. [2019-09-08 05:53:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:53:48,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:48,151 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:53:48,151 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:48,152 INFO L82 PathProgramCache]: Analyzing trace with hash -528556357, now seen corresponding path program 1 times [2019-09-08 05:53:48,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:48,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:48,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:53:48,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:48,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:53:48,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:53:48,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:53:48,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:53:48,690 INFO L87 Difference]: Start difference. First operand 1204 states and 1843 transitions. Second operand 6 states. [2019-09-08 05:53:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:49,413 INFO L93 Difference]: Finished difference Result 2682 states and 4084 transitions. [2019-09-08 05:53:49,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:53:49,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-09-08 05:53:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:49,433 INFO L225 Difference]: With dead ends: 2682 [2019-09-08 05:53:49,433 INFO L226 Difference]: Without dead ends: 2359 [2019-09-08 05:53:49,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:53:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-09-08 05:53:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2348. [2019-09-08 05:53:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-09-08 05:53:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3636 transitions. [2019-09-08 05:53:49,574 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3636 transitions. Word has length 295 [2019-09-08 05:53:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:49,575 INFO L475 AbstractCegarLoop]: Abstraction has 2348 states and 3636 transitions. [2019-09-08 05:53:49,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:53:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3636 transitions. [2019-09-08 05:53:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:53:49,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:49,591 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:53:49,591 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:49,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1922537697, now seen corresponding path program 1 times [2019-09-08 05:53:49,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:49,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:49,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:49,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:49,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:53:49,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:53:49,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:53:49,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:53:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:53:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:53:49,925 INFO L87 Difference]: Start difference. First operand 2348 states and 3636 transitions. Second operand 9 states. [2019-09-08 05:53:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:53:50,328 INFO L93 Difference]: Finished difference Result 2991 states and 4495 transitions. [2019-09-08 05:53:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:53:50,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-09-08 05:53:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:53:50,345 INFO L225 Difference]: With dead ends: 2991 [2019-09-08 05:53:50,346 INFO L226 Difference]: Without dead ends: 2322 [2019-09-08 05:53:50,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:53:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2019-09-08 05:53:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2318. [2019-09-08 05:53:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-09-08 05:53:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3585 transitions. [2019-09-08 05:53:50,476 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3585 transitions. Word has length 296 [2019-09-08 05:53:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:53:50,477 INFO L475 AbstractCegarLoop]: Abstraction has 2318 states and 3585 transitions. [2019-09-08 05:53:50,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:53:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3585 transitions. [2019-09-08 05:53:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 05:53:50,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:53:50,492 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:53:50,493 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:53:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:53:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1501375971, now seen corresponding path program 1 times [2019-09-08 05:53:50,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:53:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:53:50,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:50,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:53:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:53:51,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:53:51,054 INFO L223 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-09-08 05:53:51,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:53:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:53:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 3330 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:53:51,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:53:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:53:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:53:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:53:52,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:53:52,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:53:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:53:52,081 INFO L87 Difference]: Start difference. First operand 2318 states and 3585 transitions. Second operand 29 states. [2019-09-08 05:54:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:29,333 INFO L93 Difference]: Finished difference Result 11222 states and 17411 transitions. [2019-09-08 05:54:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 05:54:29,334 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 289 [2019-09-08 05:54:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:29,395 INFO L225 Difference]: With dead ends: 11222 [2019-09-08 05:54:29,395 INFO L226 Difference]: Without dead ends: 8796 [2019-09-08 05:54:29,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10451 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-09-08 05:54:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8796 states. [2019-09-08 05:54:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8796 to 8398. [2019-09-08 05:54:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-09-08 05:54:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 12814 transitions. [2019-09-08 05:54:29,978 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 12814 transitions. Word has length 289 [2019-09-08 05:54:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:29,979 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 12814 transitions. [2019-09-08 05:54:29,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:54:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 12814 transitions. [2019-09-08 05:54:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:54:30,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:30,013 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:54:30,013 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1853023057, now seen corresponding path program 1 times [2019-09-08 05:54:30,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:30,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:30,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:30,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:30,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 05:54:30,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:54:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:54:30,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:54:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:54:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:54:30,310 INFO L87 Difference]: Start difference. First operand 8398 states and 12814 transitions. Second operand 5 states. [2019-09-08 05:54:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:30,695 INFO L93 Difference]: Finished difference Result 13143 states and 19526 transitions. [2019-09-08 05:54:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:54:30,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 05:54:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:30,781 INFO L225 Difference]: With dead ends: 13143 [2019-09-08 05:54:30,781 INFO L226 Difference]: Without dead ends: 8027 [2019-09-08 05:54:30,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:54:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2019-09-08 05:54:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 7953. [2019-09-08 05:54:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2019-09-08 05:54:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 12146 transitions. [2019-09-08 05:54:31,387 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 12146 transitions. Word has length 294 [2019-09-08 05:54:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:31,387 INFO L475 AbstractCegarLoop]: Abstraction has 7953 states and 12146 transitions. [2019-09-08 05:54:31,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:54:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 12146 transitions. [2019-09-08 05:54:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:54:31,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:31,423 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:54:31,424 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 287553654, now seen corresponding path program 1 times [2019-09-08 05:54:31,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:31,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:54:31,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:54:31,764 INFO L223 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-09-08 05:54:31,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:32,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:54:32,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:54:32,477 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-09-08 05:54:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:54:32,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:54:32,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-08 05:54:32,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:54:32,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:54:32,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:54:32,661 INFO L87 Difference]: Start difference. First operand 7953 states and 12146 transitions. Second operand 21 states. [2019-09-08 05:54:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:54:34,883 INFO L93 Difference]: Finished difference Result 16533 states and 25889 transitions. [2019-09-08 05:54:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:54:34,884 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 294 [2019-09-08 05:54:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:54:34,928 INFO L225 Difference]: With dead ends: 16533 [2019-09-08 05:54:34,929 INFO L226 Difference]: Without dead ends: 8465 [2019-09-08 05:54:34,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 05:54:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8465 states. [2019-09-08 05:54:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8465 to 8423. [2019-09-08 05:54:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8423 states. [2019-09-08 05:54:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12922 transitions. [2019-09-08 05:54:35,522 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12922 transitions. Word has length 294 [2019-09-08 05:54:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:54:35,524 INFO L475 AbstractCegarLoop]: Abstraction has 8423 states and 12922 transitions. [2019-09-08 05:54:35,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:54:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12922 transitions. [2019-09-08 05:54:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:54:35,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:54:35,560 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:54:35,561 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:54:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:54:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash -78145910, now seen corresponding path program 1 times [2019-09-08 05:54:35,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:54:35,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:54:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:35,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:54:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 05:54:35,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:54:35,958 INFO L223 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-09-08 05:54:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:54:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:54:36,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:54:36,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:54:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:54:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:54:36,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:54:36,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:54:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:54:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:54:36,655 INFO L87 Difference]: Start difference. First operand 8423 states and 12922 transitions. Second operand 25 states. [2019-09-08 05:54:52,887 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-09-08 05:55:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:55:08,519 INFO L93 Difference]: Finished difference Result 22829 states and 35044 transitions. [2019-09-08 05:55:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:55:08,520 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 294 [2019-09-08 05:55:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:55:08,578 INFO L225 Difference]: With dead ends: 22829 [2019-09-08 05:55:08,578 INFO L226 Difference]: Without dead ends: 12741 [2019-09-08 05:55:08,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9535 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:55:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-09-08 05:55:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 11447. [2019-09-08 05:55:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11447 states. [2019-09-08 05:55:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11447 states to 11447 states and 17374 transitions. [2019-09-08 05:55:09,221 INFO L78 Accepts]: Start accepts. Automaton has 11447 states and 17374 transitions. Word has length 294 [2019-09-08 05:55:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:55:09,221 INFO L475 AbstractCegarLoop]: Abstraction has 11447 states and 17374 transitions. [2019-09-08 05:55:09,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:55:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11447 states and 17374 transitions. [2019-09-08 05:55:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:55:09,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:55:09,257 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:55:09,257 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:55:09,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:55:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash -610894936, now seen corresponding path program 1 times [2019-09-08 05:55:09,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:55:09,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:55:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 05:55:09,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:55:09,681 INFO L223 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) [2019-09-08 05:55:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:55:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:10,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 3337 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:55:10,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:55:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:55:10,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:55:10,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 05:55:10,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:55:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:55:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:55:10,622 INFO L87 Difference]: Start difference. First operand 11447 states and 17374 transitions. Second operand 25 states. [2019-09-08 05:55:28,265 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-09-08 05:55:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:55:43,533 INFO L93 Difference]: Finished difference Result 30038 states and 45780 transitions. [2019-09-08 05:55:43,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 05:55:43,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 296 [2019-09-08 05:55:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:55:43,607 INFO L225 Difference]: With dead ends: 30038 [2019-09-08 05:55:43,607 INFO L226 Difference]: Without dead ends: 16091 [2019-09-08 05:55:43,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9535 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 05:55:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16091 states. [2019-09-08 05:55:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16091 to 13930. [2019-09-08 05:55:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13930 states. [2019-09-08 05:55:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13930 states to 13930 states and 21003 transitions. [2019-09-08 05:55:44,584 INFO L78 Accepts]: Start accepts. Automaton has 13930 states and 21003 transitions. Word has length 296 [2019-09-08 05:55:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:55:44,585 INFO L475 AbstractCegarLoop]: Abstraction has 13930 states and 21003 transitions. [2019-09-08 05:55:44,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:55:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 13930 states and 21003 transitions. [2019-09-08 05:55:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:55:44,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:55:44,612 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:55:44,612 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:55:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:55:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1205526933, now seen corresponding path program 1 times [2019-09-08 05:55:44,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:55:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:55:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:44,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:55:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 05:55:45,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:55:45,213 INFO L223 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-09-08 05:55:45,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:55:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:55:45,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:55:45,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:55:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 05:55:45,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:55:45,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 05:55:45,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:55:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:55:45,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:55:45,976 INFO L87 Difference]: Start difference. First operand 13930 states and 21003 transitions. Second operand 29 states. [2019-09-08 05:56:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:22,408 INFO L93 Difference]: Finished difference Result 50626 states and 77994 transitions. [2019-09-08 05:56:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-09-08 05:56:22,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 295 [2019-09-08 05:56:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:22,556 INFO L225 Difference]: With dead ends: 50626 [2019-09-08 05:56:22,557 INFO L226 Difference]: Without dead ends: 32304 [2019-09-08 05:56:22,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15335 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2506, Invalid=39314, Unknown=0, NotChecked=0, Total=41820 [2019-09-08 05:56:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32304 states. [2019-09-08 05:56:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32304 to 28239. [2019-09-08 05:56:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28239 states. [2019-09-08 05:56:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28239 states to 28239 states and 42630 transitions. [2019-09-08 05:56:24,152 INFO L78 Accepts]: Start accepts. Automaton has 28239 states and 42630 transitions. Word has length 295 [2019-09-08 05:56:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:24,153 INFO L475 AbstractCegarLoop]: Abstraction has 28239 states and 42630 transitions. [2019-09-08 05:56:24,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:56:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28239 states and 42630 transitions. [2019-09-08 05:56:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 05:56:24,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:24,171 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:24,171 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1128210583, now seen corresponding path program 1 times [2019-09-08 05:56:24,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:24,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:24,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:56:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:56:24,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:56:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:56:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:56:24,375 INFO L87 Difference]: Start difference. First operand 28239 states and 42630 transitions. Second operand 9 states. [2019-09-08 05:56:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:25,361 INFO L93 Difference]: Finished difference Result 52175 states and 80092 transitions. [2019-09-08 05:56:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:56:25,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2019-09-08 05:56:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:25,481 INFO L225 Difference]: With dead ends: 52175 [2019-09-08 05:56:25,482 INFO L226 Difference]: Without dead ends: 29244 [2019-09-08 05:56:25,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:56:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29244 states. [2019-09-08 05:56:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29244 to 28987. [2019-09-08 05:56:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28987 states. [2019-09-08 05:56:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28987 states to 28987 states and 43813 transitions. [2019-09-08 05:56:26,676 INFO L78 Accepts]: Start accepts. Automaton has 28987 states and 43813 transitions. Word has length 297 [2019-09-08 05:56:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:26,677 INFO L475 AbstractCegarLoop]: Abstraction has 28987 states and 43813 transitions. [2019-09-08 05:56:26,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:56:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 28987 states and 43813 transitions. [2019-09-08 05:56:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:56:26,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:26,701 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:26,701 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash 239142271, now seen corresponding path program 1 times [2019-09-08 05:56:26,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:26,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:26,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:26,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:26,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:56:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:26,884 INFO L223 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-09-08 05:56:26,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:27,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 3337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:56:27,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:56:28,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:28,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 05:56:28,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:56:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:56:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:56:28,098 INFO L87 Difference]: Start difference. First operand 28987 states and 43813 transitions. Second operand 10 states. [2019-09-08 05:56:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:32,154 INFO L93 Difference]: Finished difference Result 87908 states and 133276 transitions. [2019-09-08 05:56:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:56:32,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 296 [2019-09-08 05:56:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:32,391 INFO L225 Difference]: With dead ends: 87908 [2019-09-08 05:56:32,391 INFO L226 Difference]: Without dead ends: 58739 [2019-09-08 05:56:32,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:56:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58739 states. [2019-09-08 05:56:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58739 to 58127. [2019-09-08 05:56:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58127 states. [2019-09-08 05:56:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58127 states to 58127 states and 87914 transitions. [2019-09-08 05:56:34,899 INFO L78 Accepts]: Start accepts. Automaton has 58127 states and 87914 transitions. Word has length 296 [2019-09-08 05:56:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:34,899 INFO L475 AbstractCegarLoop]: Abstraction has 58127 states and 87914 transitions. [2019-09-08 05:56:34,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:56:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 58127 states and 87914 transitions. [2019-09-08 05:56:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 05:56:34,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:34,934 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:56:34,934 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 239069057, now seen corresponding path program 1 times [2019-09-08 05:56:34,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:34,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:34,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:34,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:34,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:56:35,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:35,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:56:35,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:56:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:56:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:56:35,145 INFO L87 Difference]: Start difference. First operand 58127 states and 87914 transitions. Second operand 9 states. [2019-09-08 05:56:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:37,128 INFO L93 Difference]: Finished difference Result 109965 states and 169340 transitions. [2019-09-08 05:56:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:56:37,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-08 05:56:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:37,410 INFO L225 Difference]: With dead ends: 109965 [2019-09-08 05:56:37,411 INFO L226 Difference]: Without dead ends: 60115 [2019-09-08 05:56:37,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:56:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60115 states. [2019-09-08 05:56:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60115 to 59702. [2019-09-08 05:56:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59702 states. [2019-09-08 05:56:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59702 states to 59702 states and 90361 transitions. [2019-09-08 05:56:42,311 INFO L78 Accepts]: Start accepts. Automaton has 59702 states and 90361 transitions. Word has length 300 [2019-09-08 05:56:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:42,311 INFO L475 AbstractCegarLoop]: Abstraction has 59702 states and 90361 transitions. [2019-09-08 05:56:42,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:56:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 59702 states and 90361 transitions. [2019-09-08 05:56:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 05:56:42,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:42,348 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:42,348 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash -545684943, now seen corresponding path program 1 times [2019-09-08 05:56:42,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:42,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:56:42,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:42,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:56:42,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:56:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:56:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:56:42,598 INFO L87 Difference]: Start difference. First operand 59702 states and 90361 transitions. Second operand 13 states. [2019-09-08 05:56:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:48,345 INFO L93 Difference]: Finished difference Result 171197 states and 267049 transitions. [2019-09-08 05:56:48,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:56:48,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 296 [2019-09-08 05:56:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:48,716 INFO L225 Difference]: With dead ends: 171197 [2019-09-08 05:56:48,716 INFO L226 Difference]: Without dead ends: 117930 [2019-09-08 05:56:48,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:56:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117930 states. [2019-09-08 05:56:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117930 to 116836. [2019-09-08 05:56:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116836 states. [2019-09-08 05:56:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116836 states to 116836 states and 175253 transitions. [2019-09-08 05:56:57,128 INFO L78 Accepts]: Start accepts. Automaton has 116836 states and 175253 transitions. Word has length 296 [2019-09-08 05:56:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:57,129 INFO L475 AbstractCegarLoop]: Abstraction has 116836 states and 175253 transitions. [2019-09-08 05:56:57,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:56:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 116836 states and 175253 transitions. [2019-09-08 05:56:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 05:56:57,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:57,175 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:56:57,175 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1844769286, now seen corresponding path program 1 times [2019-09-08 05:56:57,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:57,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:57,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:57,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-08 05:56:57,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:57,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:56:57,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:56:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:56:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:56:57,332 INFO L87 Difference]: Start difference. First operand 116836 states and 175253 transitions. Second operand 3 states. [2019-09-08 05:57:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:01,651 INFO L93 Difference]: Finished difference Result 240507 states and 362849 transitions. [2019-09-08 05:57:01,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:01,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-09-08 05:57:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:02,013 INFO L225 Difference]: With dead ends: 240507 [2019-09-08 05:57:02,013 INFO L226 Difference]: Without dead ends: 123760 [2019-09-08 05:57:02,200 INFO L628 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-09-08 05:57:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123760 states. [2019-09-08 05:57:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123760 to 123720. [2019-09-08 05:57:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123720 states. [2019-09-08 05:57:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123720 states to 123720 states and 187453 transitions. [2019-09-08 05:57:12,101 INFO L78 Accepts]: Start accepts. Automaton has 123720 states and 187453 transitions. Word has length 299 [2019-09-08 05:57:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:12,101 INFO L475 AbstractCegarLoop]: Abstraction has 123720 states and 187453 transitions. [2019-09-08 05:57:12,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 123720 states and 187453 transitions. [2019-09-08 05:57:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 05:57:12,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:12,202 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:57:12,202 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1152343968, now seen corresponding path program 1 times [2019-09-08 05:57:12,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:12,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:12,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:57:12,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:12,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:57:12,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:57:12,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:57:12,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:57:12,378 INFO L87 Difference]: Start difference. First operand 123720 states and 187453 transitions. Second operand 5 states. [2019-09-08 05:57:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:19,051 INFO L93 Difference]: Finished difference Result 225156 states and 342157 transitions. [2019-09-08 05:57:19,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:57:19,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 301 [2019-09-08 05:57:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:19,537 INFO L225 Difference]: With dead ends: 225156 [2019-09-08 05:57:19,537 INFO L226 Difference]: Without dead ends: 123949 [2019-09-08 05:57:20,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:57:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123949 states. [2019-09-08 05:57:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123949 to 123772. [2019-09-08 05:57:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123772 states. [2019-09-08 05:57:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123772 states to 123772 states and 187291 transitions. [2019-09-08 05:57:26,933 INFO L78 Accepts]: Start accepts. Automaton has 123772 states and 187291 transitions. Word has length 301 [2019-09-08 05:57:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:26,934 INFO L475 AbstractCegarLoop]: Abstraction has 123772 states and 187291 transitions. [2019-09-08 05:57:26,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:57:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 123772 states and 187291 transitions. [2019-09-08 05:57:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:57:27,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:27,034 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:57:27,034 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2009890869, now seen corresponding path program 1 times [2019-09-08 05:57:27,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:27,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:57:27,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:27,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:57:27,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:57:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:57:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:57:27,770 INFO L87 Difference]: Start difference. First operand 123772 states and 187291 transitions. Second operand 11 states. [2019-09-08 05:57:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:36,259 INFO L93 Difference]: Finished difference Result 243082 states and 362409 transitions. [2019-09-08 05:57:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:57:36,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-09-08 05:57:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:36,694 INFO L225 Difference]: With dead ends: 243082 [2019-09-08 05:57:36,695 INFO L226 Difference]: Without dead ends: 138802 [2019-09-08 05:57:36,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:57:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138802 states. [2019-09-08 05:57:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138802 to 126580. [2019-09-08 05:57:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126580 states. [2019-09-08 05:57:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126580 states to 126580 states and 193092 transitions. [2019-09-08 05:57:48,446 INFO L78 Accepts]: Start accepts. Automaton has 126580 states and 193092 transitions. Word has length 298 [2019-09-08 05:57:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:48,447 INFO L475 AbstractCegarLoop]: Abstraction has 126580 states and 193092 transitions. [2019-09-08 05:57:48,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:57:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 126580 states and 193092 transitions. [2019-09-08 05:57:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 05:57:48,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:48,510 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:57:48,510 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1585874822, now seen corresponding path program 1 times [2019-09-08 05:57:48,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:48,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:48,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:48,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:48,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 05:57:48,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:48,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:48,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:48,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:48,671 INFO L87 Difference]: Start difference. First operand 126580 states and 193092 transitions. Second operand 3 states. [2019-09-08 05:57:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:55,844 INFO L93 Difference]: Finished difference Result 267099 states and 411151 transitions. [2019-09-08 05:57:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:55,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-09-08 05:57:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:56,292 INFO L225 Difference]: With dead ends: 267099 [2019-09-08 05:57:56,292 INFO L226 Difference]: Without dead ends: 140608 [2019-09-08 05:57:56,525 INFO L628 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-09-08 05:57:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140608 states. [2019-09-08 05:58:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140608 to 140422. [2019-09-08 05:58:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140422 states. [2019-09-08 05:58:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140422 states to 140422 states and 217503 transitions. [2019-09-08 05:58:03,299 INFO L78 Accepts]: Start accepts. Automaton has 140422 states and 217503 transitions. Word has length 351 [2019-09-08 05:58:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:03,299 INFO L475 AbstractCegarLoop]: Abstraction has 140422 states and 217503 transitions. [2019-09-08 05:58:03,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 140422 states and 217503 transitions. [2019-09-08 05:58:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-08 05:58:03,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:03,414 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:03,414 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2146567285, now seen corresponding path program 1 times [2019-09-08 05:58:03,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:03,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:58:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:03,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:03,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:03,624 INFO L87 Difference]: Start difference. First operand 140422 states and 217503 transitions. Second operand 3 states. [2019-09-08 05:58:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:12,478 INFO L93 Difference]: Finished difference Result 306879 states and 481573 transitions. [2019-09-08 05:58:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:12,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-09-08 05:58:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:13,037 INFO L225 Difference]: With dead ends: 306879 [2019-09-08 05:58:13,037 INFO L226 Difference]: Without dead ends: 166546 [2019-09-08 05:58:13,279 INFO L628 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-09-08 05:58:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166546 states. [2019-09-08 05:58:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166546 to 166473. [2019-09-08 05:58:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166473 states. [2019-09-08 05:58:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166473 states to 166473 states and 263303 transitions. [2019-09-08 05:58:24,566 INFO L78 Accepts]: Start accepts. Automaton has 166473 states and 263303 transitions. Word has length 351 [2019-09-08 05:58:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:24,567 INFO L475 AbstractCegarLoop]: Abstraction has 166473 states and 263303 transitions. [2019-09-08 05:58:24,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 166473 states and 263303 transitions. [2019-09-08 05:58:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-08 05:58:24,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:24,800 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:58:24,800 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:24,801 INFO L82 PathProgramCache]: Analyzing trace with hash 413165575, now seen corresponding path program 1 times [2019-09-08 05:58:24,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:24,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:24,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 05:58:24,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:24,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:58:24,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:58:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:58:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:58:24,982 INFO L87 Difference]: Start difference. First operand 166473 states and 263303 transitions. Second operand 7 states. [2019-09-08 05:58:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:31,574 INFO L93 Difference]: Finished difference Result 332965 states and 529001 transitions. [2019-09-08 05:58:31,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:58:31,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2019-09-08 05:58:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:33,254 INFO L225 Difference]: With dead ends: 332965 [2019-09-08 05:58:33,255 INFO L226 Difference]: Without dead ends: 166581 [2019-09-08 05:58:33,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:58:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166581 states. [2019-09-08 05:58:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166581 to 166551. [2019-09-08 05:58:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166551 states. [2019-09-08 05:58:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166551 states to 166551 states and 263390 transitions. [2019-09-08 05:58:46,862 INFO L78 Accepts]: Start accepts. Automaton has 166551 states and 263390 transitions. Word has length 350 [2019-09-08 05:58:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:46,862 INFO L475 AbstractCegarLoop]: Abstraction has 166551 states and 263390 transitions. [2019-09-08 05:58:46,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:58:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 166551 states and 263390 transitions. [2019-09-08 05:58:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 05:58:47,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:47,094 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:47,094 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:47,095 INFO L82 PathProgramCache]: Analyzing trace with hash 930654419, now seen corresponding path program 1 times [2019-09-08 05:58:47,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:47,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:47,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 05:58:47,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:58:47,275 INFO L223 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-09-08 05:58:47,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:47,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 3633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:58:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:58:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:58:47,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-09-08 05:58:47,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:58:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:58:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:58:47,921 INFO L87 Difference]: Start difference. First operand 166551 states and 263390 transitions. Second operand 9 states. [2019-09-08 05:58:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:59,426 INFO L93 Difference]: Finished difference Result 273366 states and 422909 transitions. [2019-09-08 05:58:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:58:59,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-09-08 05:58:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:59,956 INFO L225 Difference]: With dead ends: 273366 [2019-09-08 05:58:59,956 INFO L226 Difference]: Without dead ends: 165953 [2019-09-08 05:59:00,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:59:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165953 states. [2019-09-08 05:59:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165953 to 165868. [2019-09-08 05:59:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165868 states. [2019-09-08 05:59:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165868 states to 165868 states and 259917 transitions. [2019-09-08 05:59:07,565 INFO L78 Accepts]: Start accepts. Automaton has 165868 states and 259917 transitions. Word has length 336 [2019-09-08 05:59:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:07,566 INFO L475 AbstractCegarLoop]: Abstraction has 165868 states and 259917 transitions. [2019-09-08 05:59:07,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:59:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 165868 states and 259917 transitions. [2019-09-08 05:59:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:59:07,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:07,792 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:59:07,792 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1163724192, now seen corresponding path program 1 times [2019-09-08 05:59:07,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:07,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 05:59:07,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:59:07,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:59:07,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:59:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:59:07,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:59:07,996 INFO L87 Difference]: Start difference. First operand 165868 states and 259917 transitions. Second operand 6 states. [2019-09-08 05:59:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:59:17,414 INFO L93 Difference]: Finished difference Result 317696 states and 495167 transitions. [2019-09-08 05:59:17,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:59:17,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 353 [2019-09-08 05:59:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:17,952 INFO L225 Difference]: With dead ends: 317696 [2019-09-08 05:59:17,952 INFO L226 Difference]: Without dead ends: 152008 [2019-09-08 05:59:18,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:59:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152008 states. [2019-09-08 05:59:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152008 to 152002. [2019-09-08 05:59:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152002 states. [2019-09-08 05:59:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152002 states to 152002 states and 234705 transitions. [2019-09-08 05:59:26,209 INFO L78 Accepts]: Start accepts. Automaton has 152002 states and 234705 transitions. Word has length 353 [2019-09-08 05:59:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:26,209 INFO L475 AbstractCegarLoop]: Abstraction has 152002 states and 234705 transitions. [2019-09-08 05:59:26,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:59:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 152002 states and 234705 transitions. [2019-09-08 05:59:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-08 05:59:26,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:26,386 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:59:26,386 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash 321682823, now seen corresponding path program 1 times [2019-09-08 05:59:26,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:26,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:26,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:26,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:26,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:59:26,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:59:26,599 INFO L223 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-09-08 05:59:26,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:27,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 3686 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:59:27,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:59:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:59:27,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:59:27,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-08 05:59:27,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:59:27,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:59:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:59:27,297 INFO L87 Difference]: Start difference. First operand 152002 states and 234705 transitions. Second operand 12 states. [2019-09-08 05:59:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:59:37,096 INFO L93 Difference]: Finished difference Result 263419 states and 398409 transitions. [2019-09-08 05:59:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:59:37,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 352 [2019-09-08 05:59:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:37,600 INFO L225 Difference]: With dead ends: 263419 [2019-09-08 05:59:37,600 INFO L226 Difference]: Without dead ends: 154163 [2019-09-08 05:59:37,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:59:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154163 states. [2019-09-08 05:59:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154163 to 152986. [2019-09-08 05:59:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152986 states. [2019-09-08 05:59:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152986 states to 152986 states and 236131 transitions. [2019-09-08 05:59:44,731 INFO L78 Accepts]: Start accepts. Automaton has 152986 states and 236131 transitions. Word has length 352 [2019-09-08 05:59:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:44,731 INFO L475 AbstractCegarLoop]: Abstraction has 152986 states and 236131 transitions. [2019-09-08 05:59:44,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:59:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 152986 states and 236131 transitions. [2019-09-08 05:59:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 05:59:44,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:44,925 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 05:59:44,925 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1424687906, now seen corresponding path program 1 times [2019-09-08 05:59:44,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:44,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 05:59:45,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:59:45,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:59:45,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:59:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:59:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:59:45,095 INFO L87 Difference]: Start difference. First operand 152986 states and 236131 transitions. Second operand 3 states. [2019-09-08 05:59:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:59:55,712 INFO L93 Difference]: Finished difference Result 342526 states and 536156 transitions. [2019-09-08 05:59:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:59:55,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 05:59:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:56,271 INFO L225 Difference]: With dead ends: 342526 [2019-09-08 05:59:56,271 INFO L226 Difference]: Without dead ends: 190355 [2019-09-08 05:59:56,525 INFO L628 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-09-08 05:59:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190355 states. [2019-09-08 06:00:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190355 to 190343. [2019-09-08 06:00:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190343 states. [2019-09-08 06:00:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190343 states to 190343 states and 300013 transitions. [2019-09-08 06:00:05,270 INFO L78 Accepts]: Start accepts. Automaton has 190343 states and 300013 transitions. Word has length 322 [2019-09-08 06:00:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:05,271 INFO L475 AbstractCegarLoop]: Abstraction has 190343 states and 300013 transitions. [2019-09-08 06:00:05,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:00:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 190343 states and 300013 transitions. [2019-09-08 06:00:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 06:00:05,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:05,607 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:00:05,607 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1200430382, now seen corresponding path program 1 times [2019-09-08 06:00:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:05,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 06:00:05,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:00:05,896 INFO L223 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-09-08 06:00:05,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:06,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 3737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 06:00:06,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:00:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 06:00:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:00:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-09-08 06:00:06,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:00:06,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:00:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:00:06,601 INFO L87 Difference]: Start difference. First operand 190343 states and 300013 transitions. Second operand 20 states. [2019-09-08 06:00:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:19,496 INFO L93 Difference]: Finished difference Result 305538 states and 470214 transitions. [2019-09-08 06:00:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 06:00:19,496 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 367 [2019-09-08 06:00:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:20,211 INFO L225 Difference]: With dead ends: 305538 [2019-09-08 06:00:20,211 INFO L226 Difference]: Without dead ends: 195920 [2019-09-08 06:00:20,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-08 06:00:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195920 states. [2019-09-08 06:00:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195920 to 195396. [2019-09-08 06:00:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195396 states. [2019-09-08 06:00:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195396 states to 195396 states and 307740 transitions. [2019-09-08 06:00:29,710 INFO L78 Accepts]: Start accepts. Automaton has 195396 states and 307740 transitions. Word has length 367 [2019-09-08 06:00:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:29,710 INFO L475 AbstractCegarLoop]: Abstraction has 195396 states and 307740 transitions. [2019-09-08 06:00:29,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:00:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 195396 states and 307740 transitions. [2019-09-08 06:00:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 06:00:30,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:30,044 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-08 06:00:30,044 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1733080167, now seen corresponding path program 1 times [2019-09-08 06:00:30,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:30,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:30,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:30,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:30,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 06:00:31,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:00:31,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:00:31,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:00:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:00:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:00:31,031 INFO L87 Difference]: Start difference. First operand 195396 states and 307740 transitions. Second operand 3 states. [2019-09-08 06:00:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:44,314 INFO L93 Difference]: Finished difference Result 459317 states and 732706 transitions. [2019-09-08 06:00:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:00:44,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 06:00:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:45,234 INFO L225 Difference]: With dead ends: 459317 [2019-09-08 06:00:45,234 INFO L226 Difference]: Without dead ends: 268440 [2019-09-08 06:00:45,598 INFO L628 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-09-08 06:00:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268440 states. [2019-09-08 06:01:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268440 to 268428. [2019-09-08 06:01:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268428 states. [2019-09-08 06:01:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268428 states to 268428 states and 429453 transitions. [2019-09-08 06:01:04,706 INFO L78 Accepts]: Start accepts. Automaton has 268428 states and 429453 transitions. Word has length 323 [2019-09-08 06:01:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:01:04,707 INFO L475 AbstractCegarLoop]: Abstraction has 268428 states and 429453 transitions. [2019-09-08 06:01:04,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:01:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 268428 states and 429453 transitions. [2019-09-08 06:01:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 06:01:05,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:01:05,350 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:01:05,351 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:01:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:01:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -989160869, now seen corresponding path program 1 times [2019-09-08 06:01:05,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:01:05,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:01:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 06:01:06,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:01:06,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:01:06,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:01:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:01:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:01:06,583 INFO L87 Difference]: Start difference. First operand 268428 states and 429453 transitions. Second operand 3 states. [2019-09-08 06:01:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:29,699 INFO L93 Difference]: Finished difference Result 666820 states and 1081667 transitions. [2019-09-08 06:01:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:01:29,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 06:01:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:30,971 INFO L225 Difference]: With dead ends: 666820 [2019-09-08 06:01:30,972 INFO L226 Difference]: Without dead ends: 405047 [2019-09-08 06:01:31,440 INFO L628 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-09-08 06:01:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405047 states. [2019-09-08 06:02:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405047 to 405035. [2019-09-08 06:02:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405035 states. [2019-09-08 06:02:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405035 states to 405035 states and 657547 transitions. [2019-09-08 06:02:03,062 INFO L78 Accepts]: Start accepts. Automaton has 405035 states and 657547 transitions. Word has length 325 [2019-09-08 06:02:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:02:03,062 INFO L475 AbstractCegarLoop]: Abstraction has 405035 states and 657547 transitions. [2019-09-08 06:02:03,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:02:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 405035 states and 657547 transitions. [2019-09-08 06:02:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 06:02:04,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:02:04,530 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:02:04,530 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:02:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:02:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -532210884, now seen corresponding path program 1 times [2019-09-08 06:02:04,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:02:04,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:02:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 06:02:04,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:02:04,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:02:04,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:02:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:02:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:02:04,681 INFO L87 Difference]: Start difference. First operand 405035 states and 657547 transitions. Second operand 3 states. [2019-09-08 06:02:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:02:38,643 INFO L93 Difference]: Finished difference Result 759692 states and 1224353 transitions. [2019-09-08 06:02:38,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:02:38,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 06:02:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:02:40,800 INFO L225 Difference]: With dead ends: 759692 [2019-09-08 06:02:40,801 INFO L226 Difference]: Without dead ends: 652046 [2019-09-08 06:02:41,118 INFO L628 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-09-08 06:02:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652046 states. [2019-09-08 06:03:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652046 to 652034. [2019-09-08 06:03:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652034 states. [2019-09-08 06:03:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652034 states to 652034 states and 1057435 transitions. [2019-09-08 06:03:40,711 INFO L78 Accepts]: Start accepts. Automaton has 652034 states and 1057435 transitions. Word has length 327 [2019-09-08 06:03:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:03:40,711 INFO L475 AbstractCegarLoop]: Abstraction has 652034 states and 1057435 transitions. [2019-09-08 06:03:40,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:03:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 652034 states and 1057435 transitions. [2019-09-08 06:03:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 06:03:43,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:03:43,068 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:03:43,068 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:03:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:03:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -107645534, now seen corresponding path program 1 times [2019-09-08 06:03:43,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:03:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:03:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 06:03:43,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:03:43,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 06:03:43,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:03:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:03:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:03:43,239 INFO L87 Difference]: Start difference. First operand 652034 states and 1057435 transitions. Second operand 7 states.