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_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:55:59,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:55:59,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:55:59,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:55:59,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:55:59,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:55:59,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:55:59,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:55:59,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:55:59,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:55:59,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:55:59,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:55:59,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:55:59,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:55:59,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:55:59,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:55:59,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:55:59,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:55:59,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:55:59,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:55:59,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:55:59,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:55:59,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:55:59,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:55:59,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:55:59,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:55:59,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:55:59,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:55:59,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:55:59,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:55:59,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:55:59,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:55:59,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:55:59,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:55:59,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:55:59,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:55:59,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:55:59,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:55:59,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:55:59,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:55:59,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:55:59,167 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:55:59,183 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:55:59,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:55:59,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:55:59,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:55:59,186 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:55:59,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:55:59,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:55:59,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:55:59,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:55:59,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:55:59,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:55:59,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:55:59,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:55:59,188 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:55:59,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:55:59,189 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:55:59,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:55:59,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:55:59,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:55:59,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:55:59,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:55:59,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:55:59,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:55:59,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:55:59,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:55:59,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:55:59,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:55:59,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:55:59,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:55:59,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:55:59,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:55:59,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:55:59,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:55:59,263 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:55:59,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product28.cil.c [2019-09-08 05:55:59,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d089d538/b0c59932a8b64a0d87586dd6de5488a2/FLAGf7d2f92ad [2019-09-08 05:56:00,027 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:56:00,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product28.cil.c [2019-09-08 05:56:00,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d089d538/b0c59932a8b64a0d87586dd6de5488a2/FLAGf7d2f92ad [2019-09-08 05:56:00,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d089d538/b0c59932a8b64a0d87586dd6de5488a2 [2019-09-08 05:56:00,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:56:00,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:56:00,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:56:00,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:56:00,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:56:00,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:56:00" (1/1) ... [2019-09-08 05:56:00,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ec32d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:00, skipping insertion in model container [2019-09-08 05:56:00,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:56:00" (1/1) ... [2019-09-08 05:56:00,225 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:56:00,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:56:01,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:56:01,071 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:56:01,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:56:01,336 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:56:01,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01 WrapperNode [2019-09-08 05:56:01,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:56:01,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:56:01,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:56:01,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:56:01,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (1/1) ... [2019-09-08 05:56:01,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:56:01,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:56:01,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:56:01,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:56:01,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (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:56:01,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:56:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:56:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:56:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:56:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:56:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:56:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:56:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:56:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:56:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:56:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:56:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:56:01,620 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:56:01,620 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:56:01,621 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:56:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:56:01,624 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:56:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:56:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:56:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:56:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:56:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:56:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:56:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:56:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:56:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:56:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:56:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:56:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:56:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:56:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:56:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:56:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:56:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:56:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:56:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:56:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:56:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:56:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:56:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:56:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:56:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:56:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:56:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:56:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:56:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:56:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:56:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:56:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:56:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:56:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:56:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:56:01,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:56:01,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:56:01,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:56:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:56:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:56:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:56:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:56:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:56:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:56:01,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:56:01,636 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:56:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:56:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:56:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:56:01,639 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-09-08 05:56:01,639 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:56:01,639 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:56:01,640 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:56:01,640 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:56:01,640 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:56:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:56:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:56:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:56:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:56:01,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:56:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:56:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:56:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:56:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:56:01,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:56:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:56:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:56:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:56:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:56:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:56:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:56:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:56:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:56:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:56:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:56:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:56:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:56:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:56:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:56:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:56:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:56:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:56:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:56:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:56:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:56:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:56:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:56:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:56:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:56:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:56:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:56:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:56:01,658 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:56:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:56:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:56:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:56:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:56:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:56:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:56:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:56:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:56:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:56:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:56:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:56:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:56:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:56:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:56:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:56:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:56:01,665 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:56:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:56:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:56:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:56:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:56:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:56:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:56:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:56:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:56:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:56:01,670 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:56:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:56:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:56:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:56:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:56:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-09-08 05:56:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:56:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:56:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:56:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:56:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:56:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:56:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:56:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:56:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:56:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:56:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:56:03,793 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:56:03,793 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:56:03,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:56:03 BoogieIcfgContainer [2019-09-08 05:56:03,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:56:03,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:56:03,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:56:03,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:56:03,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:56:00" (1/3) ... [2019-09-08 05:56:03,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6455d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:56:03, skipping insertion in model container [2019-09-08 05:56:03,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:56:01" (2/3) ... [2019-09-08 05:56:03,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6455d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:56:03, skipping insertion in model container [2019-09-08 05:56:03,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:56:03" (3/3) ... [2019-09-08 05:56:03,806 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product28.cil.c [2019-09-08 05:56:03,817 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:56:03,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:56:03,850 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:56:03,908 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:56:03,909 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:56:03,910 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:56:03,910 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:56:03,910 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:56:03,910 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:56:03,910 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:56:03,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:56:03,911 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:56:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states. [2019-09-08 05:56:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 05:56:03,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:03,998 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, 1, 1, 1] [2019-09-08 05:56:04,001 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:04,019 INFO L82 PathProgramCache]: Analyzing trace with hash 419003498, now seen corresponding path program 1 times [2019-09-08 05:56:04,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:04,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:04,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:04,655 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:56:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:56:04,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:56:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:56:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:56:04,683 INFO L87 Difference]: Start difference. First operand 513 states. Second operand 2 states. [2019-09-08 05:56:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:04,784 INFO L93 Difference]: Finished difference Result 723 states and 956 transitions. [2019-09-08 05:56:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:56:04,786 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-09-08 05:56:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:04,808 INFO L225 Difference]: With dead ends: 723 [2019-09-08 05:56:04,809 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 05:56:04,815 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:56:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 05:56:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2019-09-08 05:56:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-08 05:56:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 615 transitions. [2019-09-08 05:56:04,906 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 615 transitions. Word has length 158 [2019-09-08 05:56:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:04,909 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 615 transitions. [2019-09-08 05:56:04,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:56:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 615 transitions. [2019-09-08 05:56:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 05:56:04,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:04,914 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, 1, 1, 1, 1] [2019-09-08 05:56:04,915 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1840062497, now seen corresponding path program 1 times [2019-09-08 05:56:04,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:04,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:04,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:04,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:04,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:05,232 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:56:05,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:05,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:56:05,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:56:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:56:05,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:56:05,236 INFO L87 Difference]: Start difference. First operand 462 states and 615 transitions. Second operand 3 states. [2019-09-08 05:56:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:05,279 INFO L93 Difference]: Finished difference Result 706 states and 924 transitions. [2019-09-08 05:56:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:56:05,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 05:56:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:05,285 INFO L225 Difference]: With dead ends: 706 [2019-09-08 05:56:05,286 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 05:56:05,289 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:56:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 05:56:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2019-09-08 05:56:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 05:56:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 617 transitions. [2019-09-08 05:56:05,331 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 617 transitions. Word has length 159 [2019-09-08 05:56:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:05,332 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 617 transitions. [2019-09-08 05:56:05,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:56:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2019-09-08 05:56:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:56:05,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:05,337 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:56:05,337 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1272244619, now seen corresponding path program 1 times [2019-09-08 05:56:05,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:05,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:05,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:05,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:05,617 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:56:05,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:05,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:56:05,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:56:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:56:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:56:05,621 INFO L87 Difference]: Start difference. First operand 464 states and 617 transitions. Second operand 3 states. [2019-09-08 05:56:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:05,671 INFO L93 Difference]: Finished difference Result 902 states and 1229 transitions. [2019-09-08 05:56:05,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:56:05,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 05:56:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:05,682 INFO L225 Difference]: With dead ends: 902 [2019-09-08 05:56:05,682 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 05:56:05,685 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:56:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 05:56:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2019-09-08 05:56:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 05:56:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 683 transitions. [2019-09-08 05:56:05,735 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 683 transitions. Word has length 165 [2019-09-08 05:56:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:05,737 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 683 transitions. [2019-09-08 05:56:05,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:56:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 683 transitions. [2019-09-08 05:56:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:56:05,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:05,744 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:56:05,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:05,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1238780960, now seen corresponding path program 1 times [2019-09-08 05:56:05,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:05,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:05,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:05,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:06,003 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:56:06,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:06,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:56:06,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:56:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:56:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:56:06,005 INFO L87 Difference]: Start difference. First operand 502 states and 683 transitions. Second operand 3 states. [2019-09-08 05:56:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:06,054 INFO L93 Difference]: Finished difference Result 824 states and 1109 transitions. [2019-09-08 05:56:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:56:06,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 05:56:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:06,059 INFO L225 Difference]: With dead ends: 824 [2019-09-08 05:56:06,060 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 05:56:06,061 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:56:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 05:56:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 05:56:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 05:56:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 800 transitions. [2019-09-08 05:56:06,090 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 800 transitions. Word has length 166 [2019-09-08 05:56:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:06,091 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 800 transitions. [2019-09-08 05:56:06,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:56:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 800 transitions. [2019-09-08 05:56:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 05:56:06,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:06,098 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:06,098 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2093416572, now seen corresponding path program 1 times [2019-09-08 05:56:06,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 05:56:06,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:06,641 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:56:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:07,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 3148 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:56:07,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:56:07,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:07,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 28 [2019-09-08 05:56:07,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 05:56:07,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 05:56:07,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:56:07,620 INFO L87 Difference]: Start difference. First operand 590 states and 800 transitions. Second operand 28 states. [2019-09-08 05:56:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:22,174 INFO L93 Difference]: Finished difference Result 2892 states and 3933 transitions. [2019-09-08 05:56:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 05:56:22,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 298 [2019-09-08 05:56:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:22,203 INFO L225 Difference]: With dead ends: 2892 [2019-09-08 05:56:22,203 INFO L226 Difference]: Without dead ends: 2332 [2019-09-08 05:56:22,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3876 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=938, Invalid=12402, Unknown=0, NotChecked=0, Total=13340 [2019-09-08 05:56:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-09-08 05:56:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2141. [2019-09-08 05:56:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-09-08 05:56:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2905 transitions. [2019-09-08 05:56:22,360 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2905 transitions. Word has length 298 [2019-09-08 05:56:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:22,361 INFO L475 AbstractCegarLoop]: Abstraction has 2141 states and 2905 transitions. [2019-09-08 05:56:22,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 05:56:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2905 transitions. [2019-09-08 05:56:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 05:56:22,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:22,381 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,382 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1574226853, now seen corresponding path program 1 times [2019-09-08 05:56:22,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:22,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 05:56:22,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:56:22,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:56:22,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:56:22,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:56:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:56:22,681 INFO L87 Difference]: Start difference. First operand 2141 states and 2905 transitions. Second operand 5 states. [2019-09-08 05:56:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:22,778 INFO L93 Difference]: Finished difference Result 3294 states and 4409 transitions. [2019-09-08 05:56:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:56:22,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2019-09-08 05:56:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:22,794 INFO L225 Difference]: With dead ends: 3294 [2019-09-08 05:56:22,794 INFO L226 Difference]: Without dead ends: 2069 [2019-09-08 05:56:22,800 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:56:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-09-08 05:56:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2069. [2019-09-08 05:56:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2019-09-08 05:56:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2796 transitions. [2019-09-08 05:56:22,911 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2796 transitions. Word has length 303 [2019-09-08 05:56:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:22,912 INFO L475 AbstractCegarLoop]: Abstraction has 2069 states and 2796 transitions. [2019-09-08 05:56:22,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:56:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2796 transitions. [2019-09-08 05:56:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 05:56:22,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:22,925 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:22,925 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash -738137405, now seen corresponding path program 1 times [2019-09-08 05:56:22,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:22,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:22,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 05:56:23,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:23,265 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) [2019-09-08 05:56:23,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:56:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:23,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 3150 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:56:23,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 05:56:24,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:24,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-09-08 05:56:24,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:56:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:56:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:56:24,005 INFO L87 Difference]: Start difference. First operand 2069 states and 2796 transitions. Second operand 21 states. [2019-09-08 05:56:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:25,901 INFO L93 Difference]: Finished difference Result 4227 states and 5753 transitions. [2019-09-08 05:56:25,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:56:25,902 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 300 [2019-09-08 05:56:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:25,920 INFO L225 Difference]: With dead ends: 4227 [2019-09-08 05:56:25,921 INFO L226 Difference]: Without dead ends: 2102 [2019-09-08 05:56:25,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:56:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2019-09-08 05:56:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2034. [2019-09-08 05:56:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-09-08 05:56:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2731 transitions. [2019-09-08 05:56:26,065 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2731 transitions. Word has length 300 [2019-09-08 05:56:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:26,065 INFO L475 AbstractCegarLoop]: Abstraction has 2034 states and 2731 transitions. [2019-09-08 05:56:26,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:56:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2731 transitions. [2019-09-08 05:56:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 05:56:26,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:26,085 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,085 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1415838711, now seen corresponding path program 1 times [2019-09-08 05:56:26,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:26,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:26,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 05:56:26,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:26,597 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:56:26,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:27,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:56:27,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:56:27,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:27,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:56:27,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:56:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:56:27,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:56:27,352 INFO L87 Difference]: Start difference. First operand 2034 states and 2731 transitions. Second operand 18 states. [2019-09-08 05:56:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:30,430 INFO L93 Difference]: Finished difference Result 4100 states and 5517 transitions. [2019-09-08 05:56:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:56:30,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 302 [2019-09-08 05:56:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:30,445 INFO L225 Difference]: With dead ends: 4100 [2019-09-08 05:56:30,446 INFO L226 Difference]: Without dead ends: 2077 [2019-09-08 05:56:30,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:56:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2019-09-08 05:56:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2038. [2019-09-08 05:56:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2019-09-08 05:56:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2722 transitions. [2019-09-08 05:56:30,555 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2722 transitions. Word has length 302 [2019-09-08 05:56:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:30,555 INFO L475 AbstractCegarLoop]: Abstraction has 2038 states and 2722 transitions. [2019-09-08 05:56:30,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:56:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2722 transitions. [2019-09-08 05:56:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 05:56:30,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:30,568 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:56:30,568 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:30,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1328726568, now seen corresponding path program 1 times [2019-09-08 05:56:30,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:30,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:30,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:30,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:30,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-08 05:56:30,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:30,973 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:56:31,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:31,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:56:31,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:56:31,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:31,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2019-09-08 05:56:31,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:56:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:56:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:56:31,845 INFO L87 Difference]: Start difference. First operand 2038 states and 2722 transitions. Second operand 24 states. [2019-09-08 05:56:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:45,046 INFO L93 Difference]: Finished difference Result 4642 states and 6198 transitions. [2019-09-08 05:56:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-08 05:56:45,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 302 [2019-09-08 05:56:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:45,062 INFO L225 Difference]: With dead ends: 4642 [2019-09-08 05:56:45,063 INFO L226 Difference]: Without dead ends: 2658 [2019-09-08 05:56:45,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3344 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=851, Invalid=10705, Unknown=0, NotChecked=0, Total=11556 [2019-09-08 05:56:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-09-08 05:56:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2038. [2019-09-08 05:56:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2019-09-08 05:56:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2721 transitions. [2019-09-08 05:56:45,171 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2721 transitions. Word has length 302 [2019-09-08 05:56:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:45,172 INFO L475 AbstractCegarLoop]: Abstraction has 2038 states and 2721 transitions. [2019-09-08 05:56:45,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:56:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2721 transitions. [2019-09-08 05:56:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 05:56:45,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:45,183 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:56:45,183 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1082921663, now seen corresponding path program 1 times [2019-09-08 05:56:45,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-08 05:56:45,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:45,493 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:56:45,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:45,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 3151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:56:45,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:56:46,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:46,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 05:56:46,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:56:46,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:56:46,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:56:46,108 INFO L87 Difference]: Start difference. First operand 2038 states and 2721 transitions. Second operand 14 states. [2019-09-08 05:56:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:53,549 INFO L93 Difference]: Finished difference Result 6697 states and 8952 transitions. [2019-09-08 05:56:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:56:53,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 305 [2019-09-08 05:56:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:53,578 INFO L225 Difference]: With dead ends: 6697 [2019-09-08 05:56:53,578 INFO L226 Difference]: Without dead ends: 4731 [2019-09-08 05:56:53,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:56:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-09-08 05:56:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 3927. [2019-09-08 05:56:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3927 states. [2019-09-08 05:56:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 5249 transitions. [2019-09-08 05:56:53,806 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 5249 transitions. Word has length 305 [2019-09-08 05:56:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:53,807 INFO L475 AbstractCegarLoop]: Abstraction has 3927 states and 5249 transitions. [2019-09-08 05:56:53,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:56:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 5249 transitions. [2019-09-08 05:56:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 05:56:53,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:53,823 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:53,824 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1934959595, now seen corresponding path program 1 times [2019-09-08 05:56:53,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:53,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:53,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:53,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 05:56:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:54,278 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:54,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:54,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 3153 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:56:54,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:56:55,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:56:55,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 05:56:55,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:56:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:56:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:56:55,079 INFO L87 Difference]: Start difference. First operand 3927 states and 5249 transitions. Second operand 29 states. [2019-09-08 05:56:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:58,337 INFO L93 Difference]: Finished difference Result 7968 states and 10977 transitions. [2019-09-08 05:56:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 05:56:58,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 307 [2019-09-08 05:56:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:58,363 INFO L225 Difference]: With dead ends: 7968 [2019-09-08 05:56:58,364 INFO L226 Difference]: Without dead ends: 3341 [2019-09-08 05:56:58,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=2995, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 05:56:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2019-09-08 05:56:58,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 3313. [2019-09-08 05:56:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3313 states. [2019-09-08 05:56:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4415 transitions. [2019-09-08 05:56:58,544 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4415 transitions. Word has length 307 [2019-09-08 05:56:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:58,545 INFO L475 AbstractCegarLoop]: Abstraction has 3313 states and 4415 transitions. [2019-09-08 05:56:58,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:56:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4415 transitions. [2019-09-08 05:56:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 05:56:58,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:58,559 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,559 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1636931866, now seen corresponding path program 1 times [2019-09-08 05:56:58,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:58,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 05:56:58,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:56:58,755 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:56:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:56:59,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:56:59,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:56:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-08 05:56:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:56:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-08 05:56:59,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:56:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:56:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:56:59,417 INFO L87 Difference]: Start difference. First operand 3313 states and 4415 transitions. Second operand 7 states. [2019-09-08 05:56:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:56:59,599 INFO L93 Difference]: Finished difference Result 6285 states and 8336 transitions. [2019-09-08 05:56:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:56:59,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 322 [2019-09-08 05:56:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:56:59,627 INFO L225 Difference]: With dead ends: 6285 [2019-09-08 05:56:59,627 INFO L226 Difference]: Without dead ends: 3459 [2019-09-08 05:56:59,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:56:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2019-09-08 05:56:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3415. [2019-09-08 05:56:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-09-08 05:56:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4564 transitions. [2019-09-08 05:56:59,821 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4564 transitions. Word has length 322 [2019-09-08 05:56:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:56:59,821 INFO L475 AbstractCegarLoop]: Abstraction has 3415 states and 4564 transitions. [2019-09-08 05:56:59,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:56:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4564 transitions. [2019-09-08 05:56:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 05:56:59,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:56:59,837 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,837 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:56:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:56:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -326259794, now seen corresponding path program 1 times [2019-09-08 05:56:59,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:56:59,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:56:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:59,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:56:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:56:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:00,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:00,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:00,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:00,025 INFO L87 Difference]: Start difference. First operand 3415 states and 4564 transitions. Second operand 3 states. [2019-09-08 05:57:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:00,139 INFO L93 Difference]: Finished difference Result 6887 states and 9291 transitions. [2019-09-08 05:57:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:00,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 05:57:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:00,169 INFO L225 Difference]: With dead ends: 6887 [2019-09-08 05:57:00,169 INFO L226 Difference]: Without dead ends: 3573 [2019-09-08 05:57:00,180 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:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2019-09-08 05:57:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3571. [2019-09-08 05:57:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2019-09-08 05:57:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4838 transitions. [2019-09-08 05:57:00,351 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4838 transitions. Word has length 318 [2019-09-08 05:57:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:00,352 INFO L475 AbstractCegarLoop]: Abstraction has 3571 states and 4838 transitions. [2019-09-08 05:57:00,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4838 transitions. [2019-09-08 05:57:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 05:57:00,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:00,367 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:57:00,368 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 945990148, now seen corresponding path program 1 times [2019-09-08 05:57:00,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:00,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:00,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:00,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:00,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:00,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:57:00,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:57:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:57:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:57:00,677 INFO L87 Difference]: Start difference. First operand 3571 states and 4838 transitions. Second operand 6 states. [2019-09-08 05:57:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:00,835 INFO L93 Difference]: Finished difference Result 7001 states and 9490 transitions. [2019-09-08 05:57:00,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:57:00,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2019-09-08 05:57:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:00,857 INFO L225 Difference]: With dead ends: 7001 [2019-09-08 05:57:00,857 INFO L226 Difference]: Without dead ends: 3573 [2019-09-08 05:57:00,867 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:57:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2019-09-08 05:57:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3571. [2019-09-08 05:57:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2019-09-08 05:57:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4834 transitions. [2019-09-08 05:57:01,032 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4834 transitions. Word has length 319 [2019-09-08 05:57:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:01,034 INFO L475 AbstractCegarLoop]: Abstraction has 3571 states and 4834 transitions. [2019-09-08 05:57:01,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:57:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4834 transitions. [2019-09-08 05:57:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-08 05:57:01,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:01,051 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,051 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash 739960341, now seen corresponding path program 1 times [2019-09-08 05:57:01,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:01,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:01,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:01,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:01,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:01,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:01,254 INFO L87 Difference]: Start difference. First operand 3571 states and 4834 transitions. Second operand 3 states. [2019-09-08 05:57:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:01,372 INFO L93 Difference]: Finished difference Result 7327 states and 10060 transitions. [2019-09-08 05:57:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:01,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-08 05:57:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:01,391 INFO L225 Difference]: With dead ends: 7327 [2019-09-08 05:57:01,392 INFO L226 Difference]: Without dead ends: 3863 [2019-09-08 05:57:01,406 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:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2019-09-08 05:57:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3861. [2019-09-08 05:57:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2019-09-08 05:57:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 5341 transitions. [2019-09-08 05:57:01,606 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 5341 transitions. Word has length 319 [2019-09-08 05:57:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:01,607 INFO L475 AbstractCegarLoop]: Abstraction has 3861 states and 5341 transitions. [2019-09-08 05:57:01,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 5341 transitions. [2019-09-08 05:57:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 05:57:01,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:01,625 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,626 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 224415596, now seen corresponding path program 1 times [2019-09-08 05:57:01,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:01,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:01,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:01,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:01,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:01,840 INFO L87 Difference]: Start difference. First operand 3861 states and 5341 transitions. Second operand 3 states. [2019-09-08 05:57:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:01,983 INFO L93 Difference]: Finished difference Result 8166 states and 11524 transitions. [2019-09-08 05:57:01,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:01,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 05:57:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:02,018 INFO L225 Difference]: With dead ends: 8166 [2019-09-08 05:57:02,019 INFO L226 Difference]: Without dead ends: 4419 [2019-09-08 05:57:02,032 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,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-09-08 05:57:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 4417. [2019-09-08 05:57:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-09-08 05:57:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 6300 transitions. [2019-09-08 05:57:02,315 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 6300 transitions. Word has length 320 [2019-09-08 05:57:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:02,316 INFO L475 AbstractCegarLoop]: Abstraction has 4417 states and 6300 transitions. [2019-09-08 05:57:02,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 6300 transitions. [2019-09-08 05:57:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 05:57:02,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:02,341 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,341 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1923358357, now seen corresponding path program 1 times [2019-09-08 05:57:02,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:02,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:02,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:02,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:02,527 INFO L87 Difference]: Start difference. First operand 4417 states and 6300 transitions. Second operand 3 states. [2019-09-08 05:57:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:02,720 INFO L93 Difference]: Finished difference Result 9773 states and 14298 transitions. [2019-09-08 05:57:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:02,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 05:57:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:02,746 INFO L225 Difference]: With dead ends: 9773 [2019-09-08 05:57:02,746 INFO L226 Difference]: Without dead ends: 5479 [2019-09-08 05:57:02,762 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,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-09-08 05:57:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5477. [2019-09-08 05:57:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5477 states. [2019-09-08 05:57:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 8111 transitions. [2019-09-08 05:57:03,026 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 8111 transitions. Word has length 321 [2019-09-08 05:57:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:03,026 INFO L475 AbstractCegarLoop]: Abstraction has 5477 states and 8111 transitions. [2019-09-08 05:57:03,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 8111 transitions. [2019-09-08 05:57:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 05:57:03,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:03,050 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,050 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1266021100, now seen corresponding path program 1 times [2019-09-08 05:57:03,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:03,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:03,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:03,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:03,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:03,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:03,220 INFO L87 Difference]: Start difference. First operand 5477 states and 8111 transitions. Second operand 3 states. [2019-09-08 05:57:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:03,470 INFO L93 Difference]: Finished difference Result 12973 states and 19767 transitions. [2019-09-08 05:57:03,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:03,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 05:57:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:03,500 INFO L225 Difference]: With dead ends: 12973 [2019-09-08 05:57:03,501 INFO L226 Difference]: Without dead ends: 7625 [2019-09-08 05:57:03,518 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:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7625 states. [2019-09-08 05:57:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7625 to 7623. [2019-09-08 05:57:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7623 states. [2019-09-08 05:57:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 11744 transitions. [2019-09-08 05:57:04,053 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 11744 transitions. Word has length 322 [2019-09-08 05:57:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:04,053 INFO L475 AbstractCegarLoop]: Abstraction has 7623 states and 11744 transitions. [2019-09-08 05:57:04,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 11744 transitions. [2019-09-08 05:57:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 05:57:04,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:04,070 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,071 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1335992085, now seen corresponding path program 1 times [2019-09-08 05:57:04,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:04,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:04,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:04,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:04,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:04,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:04,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:04,240 INFO L87 Difference]: Start difference. First operand 7623 states and 11744 transitions. Second operand 3 states. [2019-09-08 05:57:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:04,532 INFO L93 Difference]: Finished difference Result 19083 states and 30145 transitions. [2019-09-08 05:57:04,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:04,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 05:57:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:04,583 INFO L225 Difference]: With dead ends: 19083 [2019-09-08 05:57:04,583 INFO L226 Difference]: Without dead ends: 11595 [2019-09-08 05:57:04,606 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:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11595 states. [2019-09-08 05:57:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11595 to 11593. [2019-09-08 05:57:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-09-08 05:57:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 18433 transitions. [2019-09-08 05:57:05,462 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 18433 transitions. Word has length 323 [2019-09-08 05:57:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:05,462 INFO L475 AbstractCegarLoop]: Abstraction has 11593 states and 18433 transitions. [2019-09-08 05:57:05,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 18433 transitions. [2019-09-08 05:57:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 05:57:05,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:05,496 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:57:05,496 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:05,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash -526892380, now seen corresponding path program 1 times [2019-09-08 05:57:05,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:05,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:57:05,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:05,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:57:05,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:57:05,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:57:05,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:57:05,755 INFO L87 Difference]: Start difference. First operand 11593 states and 18433 transitions. Second operand 10 states. [2019-09-08 05:57:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:06,168 INFO L93 Difference]: Finished difference Result 12687 states and 19828 transitions. [2019-09-08 05:57:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:57:06,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 330 [2019-09-08 05:57:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:06,235 INFO L225 Difference]: With dead ends: 12687 [2019-09-08 05:57:06,235 INFO L226 Difference]: Without dead ends: 11593 [2019-09-08 05:57:06,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:57:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11593 states. [2019-09-08 05:57:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11593 to 11593. [2019-09-08 05:57:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-09-08 05:57:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 18429 transitions. [2019-09-08 05:57:06,861 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 18429 transitions. Word has length 330 [2019-09-08 05:57:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:06,862 INFO L475 AbstractCegarLoop]: Abstraction has 11593 states and 18429 transitions. [2019-09-08 05:57:06,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:57:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 18429 transitions. [2019-09-08 05:57:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 05:57:06,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:06,892 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 05:57:06,892 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash 436264889, now seen corresponding path program 1 times [2019-09-08 05:57:06,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:06,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:06,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 05:57:07,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:57:07,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 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:57:07,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:08,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 3327 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:57:08,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:57:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-09-08 05:57:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:57:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-08 05:57:08,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:57:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:57:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:57:08,601 INFO L87 Difference]: Start difference. First operand 11593 states and 18429 transitions. Second operand 11 states. [2019-09-08 05:57:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:12,793 INFO L93 Difference]: Finished difference Result 17731 states and 26492 transitions. [2019-09-08 05:57:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 05:57:12,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 355 [2019-09-08 05:57:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:12,851 INFO L225 Difference]: With dead ends: 17731 [2019-09-08 05:57:12,851 INFO L226 Difference]: Without dead ends: 14815 [2019-09-08 05:57:12,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:57:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14815 states. [2019-09-08 05:57:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14815 to 14077. [2019-09-08 05:57:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14077 states. [2019-09-08 05:57:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14077 states to 14077 states and 21711 transitions. [2019-09-08 05:57:13,629 INFO L78 Accepts]: Start accepts. Automaton has 14077 states and 21711 transitions. Word has length 355 [2019-09-08 05:57:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:13,630 INFO L475 AbstractCegarLoop]: Abstraction has 14077 states and 21711 transitions. [2019-09-08 05:57:13,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:57:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 14077 states and 21711 transitions. [2019-09-08 05:57:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:57:13,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:13,660 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,660 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1114562221, now seen corresponding path program 1 times [2019-09-08 05:57:13,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:13,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:13,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:13,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:13,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:13,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:13,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:13,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:13,845 INFO L87 Difference]: Start difference. First operand 14077 states and 21711 transitions. Second operand 3 states. [2019-09-08 05:57:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:14,752 INFO L93 Difference]: Finished difference Result 35822 states and 56507 transitions. [2019-09-08 05:57:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:14,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 05:57:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:14,831 INFO L225 Difference]: With dead ends: 35822 [2019-09-08 05:57:14,831 INFO L226 Difference]: Without dead ends: 22212 [2019-09-08 05:57:14,864 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:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22212 states. [2019-09-08 05:57:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22212 to 22125. [2019-09-08 05:57:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22125 states. [2019-09-08 05:57:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22125 states to 22125 states and 35064 transitions. [2019-09-08 05:57:15,841 INFO L78 Accepts]: Start accepts. Automaton has 22125 states and 35064 transitions. Word has length 329 [2019-09-08 05:57:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:15,841 INFO L475 AbstractCegarLoop]: Abstraction has 22125 states and 35064 transitions. [2019-09-08 05:57:15,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 22125 states and 35064 transitions. [2019-09-08 05:57:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 05:57:15,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:15,888 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,888 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash -462381022, now seen corresponding path program 1 times [2019-09-08 05:57:15,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:15,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:16,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:16,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:16,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:16,269 INFO L87 Difference]: Start difference. First operand 22125 states and 35064 transitions. Second operand 3 states. [2019-09-08 05:57:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:17,374 INFO L93 Difference]: Finished difference Result 58640 states and 94190 transitions. [2019-09-08 05:57:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:17,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 05:57:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:17,488 INFO L225 Difference]: With dead ends: 58640 [2019-09-08 05:57:17,489 INFO L226 Difference]: Without dead ends: 37087 [2019-09-08 05:57:17,550 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:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37087 states. [2019-09-08 05:57:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37087 to 37085. [2019-09-08 05:57:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37085 states. [2019-09-08 05:57:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37085 states to 37085 states and 59398 transitions. [2019-09-08 05:57:19,382 INFO L78 Accepts]: Start accepts. Automaton has 37085 states and 59398 transitions. Word has length 330 [2019-09-08 05:57:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:19,382 INFO L475 AbstractCegarLoop]: Abstraction has 37085 states and 59398 transitions. [2019-09-08 05:57:19,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 37085 states and 59398 transitions. [2019-09-08 05:57:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:57:19,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:19,472 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,472 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1801872047, now seen corresponding path program 1 times [2019-09-08 05:57:19,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:19,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:19,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:19,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:19,631 INFO L87 Difference]: Start difference. First operand 37085 states and 59398 transitions. Second operand 3 states. [2019-09-08 05:57:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:22,670 INFO L93 Difference]: Finished difference Result 101685 states and 164478 transitions. [2019-09-08 05:57:22,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:22,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 05:57:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:22,883 INFO L225 Difference]: With dead ends: 101685 [2019-09-08 05:57:22,883 INFO L226 Difference]: Without dead ends: 65320 [2019-09-08 05:57:22,989 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:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65320 states. [2019-09-08 05:57:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65320 to 65318. [2019-09-08 05:57:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65318 states. [2019-09-08 05:57:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65318 states to 65318 states and 105047 transitions. [2019-09-08 05:57:25,993 INFO L78 Accepts]: Start accepts. Automaton has 65318 states and 105047 transitions. Word has length 331 [2019-09-08 05:57:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:25,994 INFO L475 AbstractCegarLoop]: Abstraction has 65318 states and 105047 transitions. [2019-09-08 05:57:25,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 65318 states and 105047 transitions. [2019-09-08 05:57:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 05:57:26,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:26,209 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,209 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1489285154, now seen corresponding path program 1 times [2019-09-08 05:57:26,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:26,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 05:57:26,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:57:26,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:57:26,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:57:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:57:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:57:26,381 INFO L87 Difference]: Start difference. First operand 65318 states and 105047 transitions. Second operand 3 states. [2019-09-08 05:57:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:57:31,348 INFO L93 Difference]: Finished difference Result 123377 states and 197252 transitions. [2019-09-08 05:57:31,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:57:31,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 05:57:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:57:31,712 INFO L225 Difference]: With dead ends: 123377 [2019-09-08 05:57:31,712 INFO L226 Difference]: Without dead ends: 118668 [2019-09-08 05:57:31,771 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:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118668 states. [2019-09-08 05:57:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118668 to 118666. [2019-09-08 05:57:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118666 states. [2019-09-08 05:57:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118666 states to 118666 states and 189136 transitions. [2019-09-08 05:57:37,260 INFO L78 Accepts]: Start accepts. Automaton has 118666 states and 189136 transitions. Word has length 332 [2019-09-08 05:57:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:57:37,260 INFO L475 AbstractCegarLoop]: Abstraction has 118666 states and 189136 transitions. [2019-09-08 05:57:37,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:57:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 118666 states and 189136 transitions. [2019-09-08 05:57:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:57:37,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:57:37,706 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,706 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:57:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:57:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -638384465, now seen corresponding path program 1 times [2019-09-08 05:57:37,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:57:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:57:37,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:37,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:57:37,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:57:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 05:57:40,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:57:40,560 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) [2019-09-08 05:57:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:57:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:57:41,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 05:57:41,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:57:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-08 05:57:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:57:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-09-08 05:57:41,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:57:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:57:41,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:57:41,303 INFO L87 Difference]: Start difference. First operand 118666 states and 189136 transitions. Second operand 12 states. [2019-09-08 05:58:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:16,323 INFO L93 Difference]: Finished difference Result 529933 states and 886582 transitions. [2019-09-08 05:58:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 05:58:16,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 333 [2019-09-08 05:58:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:18,152 INFO L225 Difference]: With dead ends: 529933 [2019-09-08 05:58:18,152 INFO L226 Difference]: Without dead ends: 525278 [2019-09-08 05:58:18,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 05:58:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525278 states. [2019-09-08 05:58:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525278 to 357379. [2019-09-08 05:58:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357379 states. [2019-09-08 05:58:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357379 states to 357379 states and 596938 transitions. [2019-09-08 05:58:53,000 INFO L78 Accepts]: Start accepts. Automaton has 357379 states and 596938 transitions. Word has length 333 [2019-09-08 05:58:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:53,000 INFO L475 AbstractCegarLoop]: Abstraction has 357379 states and 596938 transitions. [2019-09-08 05:58:53,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:58:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 357379 states and 596938 transitions. [2019-09-08 05:59:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:59:03,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:03,527 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,528 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1376395786, now seen corresponding path program 1 times [2019-09-08 05:59:03,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:03,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:03,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 05:59:03,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:59:03,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:59:03,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:59:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:04,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:59:04,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:59:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:59:04,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:59:04,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 05:59:04,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:59:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:59:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:59:04,294 INFO L87 Difference]: Start difference. First operand 357379 states and 596938 transitions. Second operand 12 states. [2019-09-08 05:59:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:59:28,523 INFO L93 Difference]: Finished difference Result 531690 states and 888552 transitions. [2019-09-08 05:59:28,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:59:28,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 333 [2019-09-08 05:59:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:29,581 INFO L225 Difference]: With dead ends: 531690 [2019-09-08 05:59:29,581 INFO L226 Difference]: Without dead ends: 352999 [2019-09-08 05:59:29,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:59:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352999 states. [2019-09-08 05:59:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352999 to 352977. [2019-09-08 05:59:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352977 states. [2019-09-08 05:59:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352977 states to 352977 states and 590033 transitions. [2019-09-08 05:59:59,668 INFO L78 Accepts]: Start accepts. Automaton has 352977 states and 590033 transitions. Word has length 333 [2019-09-08 05:59:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:59,669 INFO L475 AbstractCegarLoop]: Abstraction has 352977 states and 590033 transitions. [2019-09-08 05:59:59,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:59:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 352977 states and 590033 transitions. [2019-09-08 06:00:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 06:00:00,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:00,983 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,983 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1836450637, now seen corresponding path program 1 times [2019-09-08 06:00:00,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:00,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:00,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:00,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 06:00:01,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:00:01,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:00:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:02,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 3267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:00:02,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:00:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 06:00:02,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:00:02,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-08 06:00:02,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:00:02,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:00:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:00:02,733 INFO L87 Difference]: Start difference. First operand 352977 states and 590033 transitions. Second operand 20 states. [2019-09-08 06:00:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:25,670 INFO L93 Difference]: Finished difference Result 361948 states and 601668 transitions. [2019-09-08 06:00:25,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:00:25,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 334 [2019-09-08 06:00:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:26,632 INFO L225 Difference]: With dead ends: 361948 [2019-09-08 06:00:26,632 INFO L226 Difference]: Without dead ends: 354097 [2019-09-08 06:00:26,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:00:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354097 states. [2019-09-08 06:00:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354097 to 352953. [2019-09-08 06:00:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352953 states. [2019-09-08 06:00:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352953 states to 352953 states and 589988 transitions. [2019-09-08 06:00:56,684 INFO L78 Accepts]: Start accepts. Automaton has 352953 states and 589988 transitions. Word has length 334 [2019-09-08 06:00:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:56,685 INFO L475 AbstractCegarLoop]: Abstraction has 352953 states and 589988 transitions. [2019-09-08 06:00:56,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:00:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 352953 states and 589988 transitions. [2019-09-08 06:00:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 06:00:57,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:57,888 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,888 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1381325340, now seen corresponding path program 1 times [2019-09-08 06:00:57,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 06:00:58,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:00:58,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:00:58,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:58,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 3309 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 06:00:58,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:00:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:00:59,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:00:59,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 22 [2019-09-08 06:00:59,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 06:00:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 06:00:59,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:00:59,029 INFO L87 Difference]: Start difference. First operand 352953 states and 589988 transitions. Second operand 22 states. [2019-09-08 06:01:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:53,682 INFO L93 Difference]: Finished difference Result 707475 states and 1242916 transitions. [2019-09-08 06:01:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 06:01:53,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 343 [2019-09-08 06:01:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:55,875 INFO L225 Difference]: With dead ends: 707475 [2019-09-08 06:01:55,875 INFO L226 Difference]: Without dead ends: 693450 [2019-09-08 06:01:56,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=505, Invalid=4325, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 06:01:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693450 states. [2019-09-08 06:03:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693450 to 691558. [2019-09-08 06:03:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691558 states. [2019-09-08 06:03:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691558 states to 691558 states and 1222603 transitions. [2019-09-08 06:03:09,843 INFO L78 Accepts]: Start accepts. Automaton has 691558 states and 1222603 transitions. Word has length 343 [2019-09-08 06:03:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:03:09,844 INFO L475 AbstractCegarLoop]: Abstraction has 691558 states and 1222603 transitions. [2019-09-08 06:03:09,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 06:03:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 691558 states and 1222603 transitions. [2019-09-08 06:03:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-08 06:03:23,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:03:23,646 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,646 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:03:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:03:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -596114021, now seen corresponding path program 1 times [2019-09-08 06:03:23,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:03:23,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:03:23,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:23,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:23,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 06:03:23,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:03:23,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:03:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:25,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 06:03:25,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:03:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:03:26,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:03:26,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2019-09-08 06:03:26,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 06:03:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 06:03:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:03:26,036 INFO L87 Difference]: Start difference. First operand 691558 states and 1222603 transitions. Second operand 28 states. [2019-09-08 06:04:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:04:20,503 INFO L93 Difference]: Finished difference Result 726562 states and 1268931 transitions. [2019-09-08 06:04:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 06:04:20,504 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 346 [2019-09-08 06:04:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:04:22,929 INFO L225 Difference]: With dead ends: 726562 [2019-09-08 06:04:22,929 INFO L226 Difference]: Without dead ends: 711392 [2019-09-08 06:04:23,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=350, Invalid=4480, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 06:04:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711392 states. [2019-09-08 06:05:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711392 to 708974. [2019-09-08 06:05:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708974 states. [2019-09-08 06:05:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708974 states to 708974 states and 1244756 transitions. [2019-09-08 06:05:44,162 INFO L78 Accepts]: Start accepts. Automaton has 708974 states and 1244756 transitions. Word has length 346 [2019-09-08 06:05:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:05:44,162 INFO L475 AbstractCegarLoop]: Abstraction has 708974 states and 1244756 transitions. [2019-09-08 06:05:44,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 06:05:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 708974 states and 1244756 transitions. [2019-09-08 06:06:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 06:06:04,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:06:04,166 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:04,166 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:06:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:06:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash -512263195, now seen corresponding path program 1 times [2019-09-08 06:06:04,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:06:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:06:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:06:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:06:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:06:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:06:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 06:06:04,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:06:04,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 06:06:04,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 06:06:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 06:06:04,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:06:04,572 INFO L87 Difference]: Start difference. First operand 708974 states and 1244756 transitions. Second operand 22 states.