java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:45:05,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:45:05,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:45:05,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:45:05,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:45:05,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:45:05,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:45:05,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:45:05,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:45:05,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:45:05,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:45:05,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:45:05,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:45:05,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:45:05,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:45:05,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:45:05,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:45:05,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:45:05,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:45:05,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:45:05,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:45:05,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:45:05,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:45:05,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:45:05,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:45:05,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:45:05,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:45:05,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:45:05,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:45:05,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:45:05,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:45:05,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:45:05,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:45:05,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:45:05,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:45:05,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:45:05,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:45:05,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:45:05,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:45:05,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:45:05,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:45:05,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:45:05,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:45:05,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:45:05,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:45:05,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:45:05,356 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:45:05,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:45:05,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:45:05,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:45:05,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:45:05,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:45:05,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:45:05,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:45:05,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:45:05,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:45:05,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:45:05,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:45:05,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:45:05,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:45:05,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:45:05,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:45:05,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:45:05,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:45:05,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:45:05,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:45:05,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:45:05,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:45:05,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:45:05,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:45:05,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:45:05,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:45:05,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:45:05,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:45:05,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:45:05,413 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:45:05,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_productSimulator.cil.c [2019-10-02 12:45:05,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e6785b41/e93a84e9f5f74aee963b7407477b7975/FLAG8a72a7462 [2019-10-02 12:45:06,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:45:06,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_productSimulator.cil.c [2019-10-02 12:45:06,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e6785b41/e93a84e9f5f74aee963b7407477b7975/FLAG8a72a7462 [2019-10-02 12:45:06,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e6785b41/e93a84e9f5f74aee963b7407477b7975 [2019-10-02 12:45:06,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:45:06,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:45:06,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:45:06,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:45:06,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:45:06,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:06" (1/1) ... [2019-10-02 12:45:06,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728f4fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:06, skipping insertion in model container [2019-10-02 12:45:06,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:06" (1/1) ... [2019-10-02 12:45:06,393 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:45:06,483 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:45:07,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:45:07,303 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:45:07,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:45:07,687 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:45:07,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07 WrapperNode [2019-10-02 12:45:07,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:45:07,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:45:07,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:45:07,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:45:07,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... [2019-10-02 12:45:07,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:45:07,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:45:07,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:45:07,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:45:07,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:45:07,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:45:07,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:45:07,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:45:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:45:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:45:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:45:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:45:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:45:07,998 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-02 12:45:07,998 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-02 12:45:07,998 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-02 12:45:07,998 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-02 12:45:07,999 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-02 12:45:07,999 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-02 12:45:07,999 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:45:07,999 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:45:08,000 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-02 12:45:08,000 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-02 12:45:08,000 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-02 12:45:08,000 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-02 12:45:08,001 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-02 12:45:08,001 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-02 12:45:08,001 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-02 12:45:08,002 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-02 12:45:08,002 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:45:08,002 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:45:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:45:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:45:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:45:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:45:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:45:08,025 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:45:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:45:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:45:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:45:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:45:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:45:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:45:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:45:08,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:45:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:45:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:45:08,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:45:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:45:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:45:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:45:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:45:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:45:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:45:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:45:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:45:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:45:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:45:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:45:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:45:08,033 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:45:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:45:08,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:45:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:45:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:45:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:45:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:45:08,036 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:45:08,036 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:45:08,037 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:45:08,037 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:45:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:45:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:45:08,040 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:45:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:45:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:45:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:45:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:45:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:45:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:45:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-02 12:45:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-02 12:45:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-02 12:45:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-02 12:45:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-02 12:45:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-02 12:45:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:45:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-02 12:45:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-02 12:45:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:45:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:45:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:45:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:45:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:45:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:45:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:45:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:45:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:45:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:45:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:45:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:45:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:45:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:45:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:45:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:45:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:45:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:45:08,060 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:45:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:45:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:45:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:45:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:45:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:45:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:45:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:45:08,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:45:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:45:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:45:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:45:08,064 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:45:08,066 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:45:08,067 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:45:08,068 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:45:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:45:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:45:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:45:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:45:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:45:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-02 12:45:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:45:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:45:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:45:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:45:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:45:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:45:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:45:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:45:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:45:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:45:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:45:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:45:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:45:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:45:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:45:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-02 12:45:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-02 12:45:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-02 12:45:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-02 12:45:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-02 12:45:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:45:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:45:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:45:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:45:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:45:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:45:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:45:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:45:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:45:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:45:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:45:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:45:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:45:10,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:45:10,528 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:45:10,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:10 BoogieIcfgContainer [2019-10-02 12:45:10,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:45:10,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:45:10,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:45:10,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:45:10,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:45:06" (1/3) ... [2019-10-02 12:45:10,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:10, skipping insertion in model container [2019-10-02 12:45:10,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:07" (2/3) ... [2019-10-02 12:45:10,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7020dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:10, skipping insertion in model container [2019-10-02 12:45:10,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:10" (3/3) ... [2019-10-02 12:45:10,541 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_productSimulator.cil.c [2019-10-02 12:45:10,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:45:10,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:45:10,587 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:45:10,645 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:45:10,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:45:10,646 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:45:10,646 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:45:10,646 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:45:10,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:45:10,647 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:45:10,647 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:45:10,647 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:45:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states. [2019-10-02 12:45:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:45:10,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:10,808 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:10,811 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1166510359, now seen corresponding path program 1 times [2019-10-02 12:45:10,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:10,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:10,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:11,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:11,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:11,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:11,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:11,711 INFO L87 Difference]: Start difference. First operand 811 states. Second operand 6 states. [2019-10-02 12:45:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:11,957 INFO L93 Difference]: Finished difference Result 1540 states and 2136 transitions. [2019-10-02 12:45:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:45:11,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-10-02 12:45:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:11,998 INFO L225 Difference]: With dead ends: 1540 [2019-10-02 12:45:11,998 INFO L226 Difference]: Without dead ends: 782 [2019-10-02 12:45:12,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:45:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-10-02 12:45:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-10-02 12:45:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-10-02 12:45:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1064 transitions. [2019-10-02 12:45:12,175 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1064 transitions. Word has length 225 [2019-10-02 12:45:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:12,183 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1064 transitions. [2019-10-02 12:45:12,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1064 transitions. [2019-10-02 12:45:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 12:45:12,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:12,197 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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] [2019-10-02 12:45:12,197 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:12,198 INFO L82 PathProgramCache]: Analyzing trace with hash -698788770, now seen corresponding path program 1 times [2019-10-02 12:45:12,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:12,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:12,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:12,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:12,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:12,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:12,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:12,709 INFO L87 Difference]: Start difference. First operand 782 states and 1064 transitions. Second operand 3 states. [2019-10-02 12:45:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:12,792 INFO L93 Difference]: Finished difference Result 1217 states and 1629 transitions. [2019-10-02 12:45:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:12,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 12:45:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:12,813 INFO L225 Difference]: With dead ends: 1217 [2019-10-02 12:45:12,813 INFO L226 Difference]: Without dead ends: 785 [2019-10-02 12:45:12,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-02 12:45:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 784. [2019-10-02 12:45:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-10-02 12:45:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1066 transitions. [2019-10-02 12:45:12,888 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1066 transitions. Word has length 231 [2019-10-02 12:45:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:12,890 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1066 transitions. [2019-10-02 12:45:12,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1066 transitions. [2019-10-02 12:45:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:45:12,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:12,908 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:12,908 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash 343321335, now seen corresponding path program 1 times [2019-10-02 12:45:12,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:12,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:12,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:45:13,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:13,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:13,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:13,601 INFO L87 Difference]: Start difference. First operand 784 states and 1066 transitions. Second operand 6 states. [2019-10-02 12:45:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:14,517 INFO L93 Difference]: Finished difference Result 1880 states and 2567 transitions. [2019-10-02 12:45:14,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:14,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-10-02 12:45:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:14,532 INFO L225 Difference]: With dead ends: 1880 [2019-10-02 12:45:14,532 INFO L226 Difference]: Without dead ends: 1461 [2019-10-02 12:45:14,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:45:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-10-02 12:45:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1452. [2019-10-02 12:45:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-10-02 12:45:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1992 transitions. [2019-10-02 12:45:14,624 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1992 transitions. Word has length 238 [2019-10-02 12:45:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:14,625 INFO L475 AbstractCegarLoop]: Abstraction has 1452 states and 1992 transitions. [2019-10-02 12:45:14,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1992 transitions. [2019-10-02 12:45:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 12:45:14,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:14,634 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:14,634 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1265830378, now seen corresponding path program 1 times [2019-10-02 12:45:14,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:45:14,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:14,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:14,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:14,980 INFO L87 Difference]: Start difference. First operand 1452 states and 1992 transitions. Second operand 6 states. [2019-10-02 12:45:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:15,818 INFO L93 Difference]: Finished difference Result 3650 states and 5004 transitions. [2019-10-02 12:45:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:15,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-10-02 12:45:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:15,837 INFO L225 Difference]: With dead ends: 3650 [2019-10-02 12:45:15,837 INFO L226 Difference]: Without dead ends: 2811 [2019-10-02 12:45:15,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:45:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2019-10-02 12:45:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2788. [2019-10-02 12:45:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2019-10-02 12:45:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3846 transitions. [2019-10-02 12:45:15,989 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3846 transitions. Word has length 239 [2019-10-02 12:45:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:15,990 INFO L475 AbstractCegarLoop]: Abstraction has 2788 states and 3846 transitions. [2019-10-02 12:45:15,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3846 transitions. [2019-10-02 12:45:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:45:16,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:16,002 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:16,003 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:16,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1889171365, now seen corresponding path program 1 times [2019-10-02 12:45:16,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:16,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:16,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:45:16,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:16,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:16,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:16,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:16,306 INFO L87 Difference]: Start difference. First operand 2788 states and 3846 transitions. Second operand 6 states. [2019-10-02 12:45:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:17,182 INFO L93 Difference]: Finished difference Result 7106 states and 9776 transitions. [2019-10-02 12:45:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:17,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-10-02 12:45:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:17,220 INFO L225 Difference]: With dead ends: 7106 [2019-10-02 12:45:17,220 INFO L226 Difference]: Without dead ends: 5066 [2019-10-02 12:45:17,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:45:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2019-10-02 12:45:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 5025. [2019-10-02 12:45:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-10-02 12:45:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 6990 transitions. [2019-10-02 12:45:17,515 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 6990 transitions. Word has length 240 [2019-10-02 12:45:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:17,516 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 6990 transitions. [2019-10-02 12:45:17,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 6990 transitions. [2019-10-02 12:45:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 12:45:17,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:17,536 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:17,536 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 852775003, now seen corresponding path program 1 times [2019-10-02 12:45:17,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:17,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:17,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:17,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:17,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:17,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:17,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:17,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:17,725 INFO L87 Difference]: Start difference. First operand 5025 states and 6990 transitions. Second operand 3 states. [2019-10-02 12:45:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:17,879 INFO L93 Difference]: Finished difference Result 10374 states and 14622 transitions. [2019-10-02 12:45:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:17,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-02 12:45:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:17,916 INFO L225 Difference]: With dead ends: 10374 [2019-10-02 12:45:17,917 INFO L226 Difference]: Without dead ends: 5464 [2019-10-02 12:45:17,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-10-02 12:45:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5457. [2019-10-02 12:45:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-10-02 12:45:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7759 transitions. [2019-10-02 12:45:18,169 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7759 transitions. Word has length 251 [2019-10-02 12:45:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:18,170 INFO L475 AbstractCegarLoop]: Abstraction has 5457 states and 7759 transitions. [2019-10-02 12:45:18,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7759 transitions. [2019-10-02 12:45:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:45:18,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:18,190 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:18,190 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1905759325, now seen corresponding path program 1 times [2019-10-02 12:45:18,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:18,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:18,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:18,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:18,592 INFO L87 Difference]: Start difference. First operand 5457 states and 7759 transitions. Second operand 3 states. [2019-10-02 12:45:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:18,807 INFO L93 Difference]: Finished difference Result 11638 states and 16873 transitions. [2019-10-02 12:45:18,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:18,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-10-02 12:45:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:18,866 INFO L225 Difference]: With dead ends: 11638 [2019-10-02 12:45:18,866 INFO L226 Difference]: Without dead ends: 6296 [2019-10-02 12:45:18,890 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-10-02 12:45:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 6289. [2019-10-02 12:45:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6289 states. [2019-10-02 12:45:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 9233 transitions. [2019-10-02 12:45:19,163 INFO L78 Accepts]: Start accepts. Automaton has 6289 states and 9233 transitions. Word has length 252 [2019-10-02 12:45:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:19,163 INFO L475 AbstractCegarLoop]: Abstraction has 6289 states and 9233 transitions. [2019-10-02 12:45:19,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 6289 states and 9233 transitions. [2019-10-02 12:45:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 12:45:19,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:19,191 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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-10-02 12:45:19,191 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:19,192 INFO L82 PathProgramCache]: Analyzing trace with hash 52663873, now seen corresponding path program 1 times [2019-10-02 12:45:19,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:19,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:19,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:19,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:19,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:19,395 INFO L87 Difference]: Start difference. First operand 6289 states and 9233 transitions. Second operand 3 states. [2019-10-02 12:45:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:19,729 INFO L93 Difference]: Finished difference Result 14070 states and 21183 transitions. [2019-10-02 12:45:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:19,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-02 12:45:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:19,800 INFO L225 Difference]: With dead ends: 14070 [2019-10-02 12:45:19,800 INFO L226 Difference]: Without dead ends: 7896 [2019-10-02 12:45:19,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7896 states. [2019-10-02 12:45:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7896 to 7889. [2019-10-02 12:45:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7889 states. [2019-10-02 12:45:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7889 states to 7889 states and 12053 transitions. [2019-10-02 12:45:20,166 INFO L78 Accepts]: Start accepts. Automaton has 7889 states and 12053 transitions. Word has length 253 [2019-10-02 12:45:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:20,167 INFO L475 AbstractCegarLoop]: Abstraction has 7889 states and 12053 transitions. [2019-10-02 12:45:20,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7889 states and 12053 transitions. [2019-10-02 12:45:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:45:20,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:20,212 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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-10-02 12:45:20,212 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash -700469827, now seen corresponding path program 1 times [2019-10-02 12:45:20,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:20,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:20,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:20,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:20,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:20,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:20,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:20,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:20,473 INFO L87 Difference]: Start difference. First operand 7889 states and 12053 transitions. Second operand 3 states. [2019-10-02 12:45:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:20,767 INFO L93 Difference]: Finished difference Result 18742 states and 29419 transitions. [2019-10-02 12:45:20,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:20,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-10-02 12:45:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:20,829 INFO L225 Difference]: With dead ends: 18742 [2019-10-02 12:45:20,829 INFO L226 Difference]: Without dead ends: 10968 [2019-10-02 12:45:20,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10968 states. [2019-10-02 12:45:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10968 to 10961. [2019-10-02 12:45:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-10-02 12:45:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 17437 transitions. [2019-10-02 12:45:21,545 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 17437 transitions. Word has length 254 [2019-10-02 12:45:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:21,545 INFO L475 AbstractCegarLoop]: Abstraction has 10961 states and 17437 transitions. [2019-10-02 12:45:21,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 17437 transitions. [2019-10-02 12:45:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:45:21,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:21,603 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:21,603 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:21,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:21,603 INFO L82 PathProgramCache]: Analyzing trace with hash -814717913, now seen corresponding path program 1 times [2019-10-02 12:45:21,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:21,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:21,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:45:21,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:21,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:21,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:21,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:21,789 INFO L87 Difference]: Start difference. First operand 10961 states and 17437 transitions. Second operand 3 states. [2019-10-02 12:45:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:22,220 INFO L93 Difference]: Finished difference Result 27702 states and 45123 transitions. [2019-10-02 12:45:22,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:22,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-02 12:45:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:22,300 INFO L225 Difference]: With dead ends: 27702 [2019-10-02 12:45:22,300 INFO L226 Difference]: Without dead ends: 16856 [2019-10-02 12:45:22,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16856 states. [2019-10-02 12:45:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16856 to 16849. [2019-10-02 12:45:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16849 states. [2019-10-02 12:45:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16849 states to 16849 states and 27693 transitions. [2019-10-02 12:45:23,915 INFO L78 Accepts]: Start accepts. Automaton has 16849 states and 27693 transitions. Word has length 255 [2019-10-02 12:45:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:23,916 INFO L475 AbstractCegarLoop]: Abstraction has 16849 states and 27693 transitions. [2019-10-02 12:45:23,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16849 states and 27693 transitions. [2019-10-02 12:45:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 12:45:23,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:23,994 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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] [2019-10-02 12:45:23,994 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash 826554327, now seen corresponding path program 1 times [2019-10-02 12:45:23,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:23,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:23,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:45:24,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:24,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:45:24,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:45:24,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:45:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:45:24,197 INFO L87 Difference]: Start difference. First operand 16849 states and 27693 transitions. Second operand 4 states. [2019-10-02 12:45:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:26,300 INFO L93 Difference]: Finished difference Result 50230 states and 83129 transitions. [2019-10-02 12:45:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:45:26,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-10-02 12:45:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:26,458 INFO L225 Difference]: With dead ends: 50230 [2019-10-02 12:45:26,458 INFO L226 Difference]: Without dead ends: 33418 [2019-10-02 12:45:26,522 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:45:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33418 states. [2019-10-02 12:45:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33418 to 33415. [2019-10-02 12:45:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33415 states. [2019-10-02 12:45:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33415 states to 33415 states and 54945 transitions. [2019-10-02 12:45:29,141 INFO L78 Accepts]: Start accepts. Automaton has 33415 states and 54945 transitions. Word has length 256 [2019-10-02 12:45:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:29,142 INFO L475 AbstractCegarLoop]: Abstraction has 33415 states and 54945 transitions. [2019-10-02 12:45:29,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:45:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 33415 states and 54945 transitions. [2019-10-02 12:45:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 12:45:29,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:29,285 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:29,285 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960127, now seen corresponding path program 1 times [2019-10-02 12:45:29,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:29,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:29,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:45:29,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:45:29,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:45:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:45:29,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:45:29,543 INFO L87 Difference]: Start difference. First operand 33415 states and 54945 transitions. Second operand 11 states. [2019-10-02 12:45:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:30,239 INFO L93 Difference]: Finished difference Result 33418 states and 54947 transitions. [2019-10-02 12:45:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:45:30,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 249 [2019-10-02 12:45:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:30,314 INFO L225 Difference]: With dead ends: 33418 [2019-10-02 12:45:30,314 INFO L226 Difference]: Without dead ends: 16824 [2019-10-02 12:45:30,356 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:45:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16824 states. [2019-10-02 12:45:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16824 to 16824. [2019-10-02 12:45:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16824 states. [2019-10-02 12:45:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16824 states to 16824 states and 27623 transitions. [2019-10-02 12:45:31,291 INFO L78 Accepts]: Start accepts. Automaton has 16824 states and 27623 transitions. Word has length 249 [2019-10-02 12:45:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:31,292 INFO L475 AbstractCegarLoop]: Abstraction has 16824 states and 27623 transitions. [2019-10-02 12:45:31,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:45:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 16824 states and 27623 transitions. [2019-10-02 12:45:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 12:45:31,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:31,349 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:31,349 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash 225047104, now seen corresponding path program 1 times [2019-10-02 12:45:31,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:31,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:31,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 12:45:31,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:31,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:45:31,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:45:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:45:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:31,521 INFO L87 Difference]: Start difference. First operand 16824 states and 27623 transitions. Second operand 3 states. [2019-10-02 12:45:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:32,167 INFO L93 Difference]: Finished difference Result 33600 states and 55282 transitions. [2019-10-02 12:45:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:45:32,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-02 12:45:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:32,231 INFO L225 Difference]: With dead ends: 33600 [2019-10-02 12:45:32,232 INFO L226 Difference]: Without dead ends: 16817 [2019-10-02 12:45:32,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:45:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2019-10-02 12:45:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 16817. [2019-10-02 12:45:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16817 states. [2019-10-02 12:45:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 27601 transitions. [2019-10-02 12:45:32,958 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 27601 transitions. Word has length 274 [2019-10-02 12:45:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:32,958 INFO L475 AbstractCegarLoop]: Abstraction has 16817 states and 27601 transitions. [2019-10-02 12:45:32,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 27601 transitions. [2019-10-02 12:45:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 12:45:33,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:33,009 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:33,010 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1480022866, now seen corresponding path program 1 times [2019-10-02 12:45:33,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:33,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:33,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:33,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:33,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 12:45:33,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:33,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:45:33,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:45:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:45:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:45:33,416 INFO L87 Difference]: Start difference. First operand 16817 states and 27601 transitions. Second operand 4 states. [2019-10-02 12:45:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:34,546 INFO L93 Difference]: Finished difference Result 33568 states and 55122 transitions. [2019-10-02 12:45:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:45:34,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-10-02 12:45:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:34,598 INFO L225 Difference]: With dead ends: 33568 [2019-10-02 12:45:34,599 INFO L226 Difference]: Without dead ends: 16817 [2019-10-02 12:45:34,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:45:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2019-10-02 12:45:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 16817. [2019-10-02 12:45:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16817 states. [2019-10-02 12:45:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 26058 transitions. [2019-10-02 12:45:35,327 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 26058 transitions. Word has length 284 [2019-10-02 12:45:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:35,327 INFO L475 AbstractCegarLoop]: Abstraction has 16817 states and 26058 transitions. [2019-10-02 12:45:35,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:45:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 26058 transitions. [2019-10-02 12:45:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:45:35,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:35,379 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:35,380 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 523294158, now seen corresponding path program 1 times [2019-10-02 12:45:35,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:35,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:35,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:35,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:35,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:45:36,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:36,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 12:45:36,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 12:45:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 12:45:36,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:45:36,593 INFO L87 Difference]: Start difference. First operand 16817 states and 26058 transitions. Second operand 22 states. [2019-10-02 12:45:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:43,811 INFO L93 Difference]: Finished difference Result 43012 states and 66057 transitions. [2019-10-02 12:45:43,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 12:45:43,812 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 311 [2019-10-02 12:45:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:43,949 INFO L225 Difference]: With dead ends: 43012 [2019-10-02 12:45:43,949 INFO L226 Difference]: Without dead ends: 40108 [2019-10-02 12:45:43,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=3815, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 12:45:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40108 states. [2019-10-02 12:45:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40108 to 39903. [2019-10-02 12:45:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39903 states. [2019-10-02 12:45:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39903 states to 39903 states and 61692 transitions. [2019-10-02 12:45:46,144 INFO L78 Accepts]: Start accepts. Automaton has 39903 states and 61692 transitions. Word has length 311 [2019-10-02 12:45:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:46,145 INFO L475 AbstractCegarLoop]: Abstraction has 39903 states and 61692 transitions. [2019-10-02 12:45:46,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 12:45:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39903 states and 61692 transitions. [2019-10-02 12:45:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 12:45:46,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:46,252 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:46,252 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:46,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2127710983, now seen corresponding path program 1 times [2019-10-02 12:45:46,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:46,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:45:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:45:46,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:45:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:45:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:45:46,568 INFO L87 Difference]: Start difference. First operand 39903 states and 61692 transitions. Second operand 15 states. [2019-10-02 12:45:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:47,788 INFO L93 Difference]: Finished difference Result 52882 states and 79332 transitions. [2019-10-02 12:45:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:45:47,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 312 [2019-10-02 12:45:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:47,945 INFO L225 Difference]: With dead ends: 52882 [2019-10-02 12:45:47,946 INFO L226 Difference]: Without dead ends: 40701 [2019-10-02 12:45:48,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:45:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40701 states. [2019-10-02 12:45:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40701 to 40701. [2019-10-02 12:45:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40701 states. [2019-10-02 12:45:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40701 states to 40701 states and 62868 transitions. [2019-10-02 12:45:50,972 INFO L78 Accepts]: Start accepts. Automaton has 40701 states and 62868 transitions. Word has length 312 [2019-10-02 12:45:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:50,973 INFO L475 AbstractCegarLoop]: Abstraction has 40701 states and 62868 transitions. [2019-10-02 12:45:50,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:45:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 40701 states and 62868 transitions. [2019-10-02 12:45:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 12:45:51,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:51,086 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:51,087 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash -194327907, now seen corresponding path program 1 times [2019-10-02 12:45:51,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:51,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:51,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:45:51,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:51,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 12:45:51,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:45:51,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:45:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:45:51,456 INFO L87 Difference]: Start difference. First operand 40701 states and 62868 transitions. Second operand 17 states. [2019-10-02 12:45:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:57,812 INFO L93 Difference]: Finished difference Result 53955 states and 81361 transitions. [2019-10-02 12:45:57,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 12:45:57,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 312 [2019-10-02 12:45:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:57,947 INFO L225 Difference]: With dead ends: 53955 [2019-10-02 12:45:57,947 INFO L226 Difference]: Without dead ends: 41571 [2019-10-02 12:45:57,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:45:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41571 states. [2019-10-02 12:46:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41571 to 41366. [2019-10-02 12:46:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41366 states. [2019-10-02 12:46:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41366 states to 41366 states and 63918 transitions. [2019-10-02 12:46:01,103 INFO L78 Accepts]: Start accepts. Automaton has 41366 states and 63918 transitions. Word has length 312 [2019-10-02 12:46:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:01,103 INFO L475 AbstractCegarLoop]: Abstraction has 41366 states and 63918 transitions. [2019-10-02 12:46:01,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:46:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 41366 states and 63918 transitions. [2019-10-02 12:46:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 12:46:01,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:01,188 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:01,188 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:01,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:01,189 INFO L82 PathProgramCache]: Analyzing trace with hash 542939995, now seen corresponding path program 1 times [2019-10-02 12:46:01,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:01,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:01,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:01,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-02 12:46:01,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-02 12:46:01,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 12:46:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 12:46:01,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-10-02 12:46:01,604 INFO L87 Difference]: Start difference. First operand 41366 states and 63918 transitions. Second operand 20 states. [2019-10-02 12:46:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:02,930 INFO L93 Difference]: Finished difference Result 54905 states and 82251 transitions. [2019-10-02 12:46:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:46:02,930 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 312 [2019-10-02 12:46:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:03,072 INFO L225 Difference]: With dead ends: 54905 [2019-10-02 12:46:03,073 INFO L226 Difference]: Without dead ends: 41695 [2019-10-02 12:46:03,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:46:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41695 states. [2019-10-02 12:46:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41695 to 41681. [2019-10-02 12:46:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41681 states. [2019-10-02 12:46:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41681 states to 41681 states and 64247 transitions. [2019-10-02 12:46:04,756 INFO L78 Accepts]: Start accepts. Automaton has 41681 states and 64247 transitions. Word has length 312 [2019-10-02 12:46:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:04,756 INFO L475 AbstractCegarLoop]: Abstraction has 41681 states and 64247 transitions. [2019-10-02 12:46:04,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 12:46:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41681 states and 64247 transitions. [2019-10-02 12:46:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 12:46:04,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:04,831 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:04,831 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash -549588799, now seen corresponding path program 1 times [2019-10-02 12:46:04,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:04,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:04,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:04,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:04,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:46:05,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:05,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:46:05,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:46:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:46:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:46:05,066 INFO L87 Difference]: Start difference. First operand 41681 states and 64247 transitions. Second operand 7 states. [2019-10-02 12:46:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:09,615 INFO L93 Difference]: Finished difference Result 81682 states and 128101 transitions. [2019-10-02 12:46:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:46:09,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 312 [2019-10-02 12:46:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:10,036 INFO L225 Difference]: With dead ends: 81682 [2019-10-02 12:46:10,037 INFO L226 Difference]: Without dead ends: 68591 [2019-10-02 12:46:10,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:46:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68591 states. [2019-10-02 12:46:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68591 to 68487. [2019-10-02 12:46:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68487 states. [2019-10-02 12:46:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68487 states to 68487 states and 105228 transitions. [2019-10-02 12:46:14,484 INFO L78 Accepts]: Start accepts. Automaton has 68487 states and 105228 transitions. Word has length 312 [2019-10-02 12:46:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:14,484 INFO L475 AbstractCegarLoop]: Abstraction has 68487 states and 105228 transitions. [2019-10-02 12:46:14,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:46:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 68487 states and 105228 transitions. [2019-10-02 12:46:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 12:46:14,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:14,576 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:14,576 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2064946049, now seen corresponding path program 1 times [2019-10-02 12:46:14,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:14,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:46:15,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:15,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-02 12:46:15,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 12:46:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 12:46:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:46:15,473 INFO L87 Difference]: Start difference. First operand 68487 states and 105228 transitions. Second operand 38 states. [2019-10-02 12:46:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:19,089 INFO L93 Difference]: Finished difference Result 112177 states and 170308 transitions. [2019-10-02 12:46:19,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 12:46:19,089 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 313 [2019-10-02 12:46:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:19,461 INFO L225 Difference]: With dead ends: 112177 [2019-10-02 12:46:19,461 INFO L226 Difference]: Without dead ends: 72560 [2019-10-02 12:46:19,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:46:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72560 states. [2019-10-02 12:46:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72560 to 72503. [2019-10-02 12:46:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72503 states. [2019-10-02 12:46:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72503 states to 72503 states and 111252 transitions. [2019-10-02 12:46:24,757 INFO L78 Accepts]: Start accepts. Automaton has 72503 states and 111252 transitions. Word has length 313 [2019-10-02 12:46:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:24,757 INFO L475 AbstractCegarLoop]: Abstraction has 72503 states and 111252 transitions. [2019-10-02 12:46:24,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 12:46:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 72503 states and 111252 transitions. [2019-10-02 12:46:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-02 12:46:24,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:24,844 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:24,844 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash -635295460, now seen corresponding path program 1 times [2019-10-02 12:46:24,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:24,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:24,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:46:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:25,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:46:25,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:46:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:46:25,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:46:25,101 INFO L87 Difference]: Start difference. First operand 72503 states and 111252 transitions. Second operand 13 states. [2019-10-02 12:46:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:26,329 INFO L93 Difference]: Finished difference Result 73094 states and 112094 transitions. [2019-10-02 12:46:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:46:26,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 317 [2019-10-02 12:46:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:26,580 INFO L225 Difference]: With dead ends: 73094 [2019-10-02 12:46:26,580 INFO L226 Difference]: Without dead ends: 73091 [2019-10-02 12:46:27,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:46:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73091 states. [2019-10-02 12:46:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73091 to 73091. [2019-10-02 12:46:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73091 states. [2019-10-02 12:46:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73091 states to 73091 states and 111980 transitions. [2019-10-02 12:46:29,360 INFO L78 Accepts]: Start accepts. Automaton has 73091 states and 111980 transitions. Word has length 317 [2019-10-02 12:46:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:29,361 INFO L475 AbstractCegarLoop]: Abstraction has 73091 states and 111980 transitions. [2019-10-02 12:46:29,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:46:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 73091 states and 111980 transitions. [2019-10-02 12:46:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 12:46:29,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:29,466 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:29,467 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:29,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2134126996, now seen corresponding path program 1 times [2019-10-02 12:46:29,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:29,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:29,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:29,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:29,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:46:30,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 12:46:30,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:46:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:46:30,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:46:30,270 INFO L87 Difference]: Start difference. First operand 73091 states and 111980 transitions. Second operand 17 states. [2019-10-02 12:46:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:32,456 INFO L93 Difference]: Finished difference Result 115445 states and 176474 transitions. [2019-10-02 12:46:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:46:32,457 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 322 [2019-10-02 12:46:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:32,709 INFO L225 Difference]: With dead ends: 115445 [2019-10-02 12:46:32,709 INFO L226 Difference]: Without dead ends: 75660 [2019-10-02 12:46:32,797 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:46:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75660 states. [2019-10-02 12:46:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75660 to 75660. [2019-10-02 12:46:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75660 states. [2019-10-02 12:46:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75660 states to 75660 states and 117307 transitions. [2019-10-02 12:46:38,021 INFO L78 Accepts]: Start accepts. Automaton has 75660 states and 117307 transitions. Word has length 322 [2019-10-02 12:46:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:38,021 INFO L475 AbstractCegarLoop]: Abstraction has 75660 states and 117307 transitions. [2019-10-02 12:46:38,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:46:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 75660 states and 117307 transitions. [2019-10-02 12:46:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 12:46:38,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:38,147 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:38,147 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash -940266895, now seen corresponding path program 1 times [2019-10-02 12:46:38,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:38,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 12:46:38,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:46:38,328 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:46:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:39,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 3849 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:46:39,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:46:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-02 12:46:39,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:46:39,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 12:46:39,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:46:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:46:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:46:39,649 INFO L87 Difference]: Start difference. First operand 75660 states and 117307 transitions. Second operand 6 states. [2019-10-02 12:46:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:44,821 INFO L93 Difference]: Finished difference Result 193678 states and 311769 transitions. [2019-10-02 12:46:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:46:44,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 329 [2019-10-02 12:46:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:45,244 INFO L225 Difference]: With dead ends: 193678 [2019-10-02 12:46:45,244 INFO L226 Difference]: Without dead ends: 118025 [2019-10-02 12:46:45,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:46:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118025 states. [2019-10-02 12:46:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118025 to 117812. [2019-10-02 12:46:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117812 states. [2019-10-02 12:46:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117812 states to 117812 states and 185596 transitions. [2019-10-02 12:46:50,128 INFO L78 Accepts]: Start accepts. Automaton has 117812 states and 185596 transitions. Word has length 329 [2019-10-02 12:46:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:50,129 INFO L475 AbstractCegarLoop]: Abstraction has 117812 states and 185596 transitions. [2019-10-02 12:46:50,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:46:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states and 185596 transitions. [2019-10-02 12:46:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 12:46:50,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:50,336 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:50,336 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -948325302, now seen corresponding path program 1 times [2019-10-02 12:46:50,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-02 12:46:50,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:50,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 12:46:50,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 12:46:50,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 12:46:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:46:50,886 INFO L87 Difference]: Start difference. First operand 117812 states and 185596 transitions. Second operand 22 states. [2019-10-02 12:46:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:57,028 INFO L93 Difference]: Finished difference Result 147431 states and 230607 transitions. [2019-10-02 12:46:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 12:46:57,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 322 [2019-10-02 12:46:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:57,464 INFO L225 Difference]: With dead ends: 147431 [2019-10-02 12:46:57,464 INFO L226 Difference]: Without dead ends: 118498 [2019-10-02 12:46:57,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:46:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118498 states. [2019-10-02 12:47:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118498 to 118414. [2019-10-02 12:47:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118414 states. [2019-10-02 12:47:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118414 states to 118414 states and 186324 transitions. [2019-10-02 12:47:02,176 INFO L78 Accepts]: Start accepts. Automaton has 118414 states and 186324 transitions. Word has length 322 [2019-10-02 12:47:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:02,176 INFO L475 AbstractCegarLoop]: Abstraction has 118414 states and 186324 transitions. [2019-10-02 12:47:02,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 12:47:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 118414 states and 186324 transitions. [2019-10-02 12:47:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 12:47:02,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:02,345 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:02,345 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash -456979548, now seen corresponding path program 1 times [2019-10-02 12:47:02,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:47:03,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:03,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-02 12:47:03,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 12:47:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 12:47:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:47:03,186 INFO L87 Difference]: Start difference. First operand 118414 states and 186324 transitions. Second operand 40 states. [2019-10-02 12:47:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:07,963 INFO L93 Difference]: Finished difference Result 151411 states and 237455 transitions. [2019-10-02 12:47:07,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 12:47:07,963 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 322 [2019-10-02 12:47:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:08,465 INFO L225 Difference]: With dead ends: 151411 [2019-10-02 12:47:08,466 INFO L226 Difference]: Without dead ends: 121946 [2019-10-02 12:47:08,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 12:47:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121946 states. [2019-10-02 12:47:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121946 to 121945. [2019-10-02 12:47:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121945 states. [2019-10-02 12:47:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121945 states to 121945 states and 191778 transitions. [2019-10-02 12:47:17,667 INFO L78 Accepts]: Start accepts. Automaton has 121945 states and 191778 transitions. Word has length 322 [2019-10-02 12:47:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:17,668 INFO L475 AbstractCegarLoop]: Abstraction has 121945 states and 191778 transitions. [2019-10-02 12:47:17,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 12:47:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 121945 states and 191778 transitions. [2019-10-02 12:47:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 12:47:17,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:17,871 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:17,872 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1277048066, now seen corresponding path program 1 times [2019-10-02 12:47:17,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:17,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:17,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:47:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:18,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:47:18,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:47:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:47:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:47:18,550 INFO L87 Difference]: Start difference. First operand 121945 states and 191778 transitions. Second operand 5 states. [2019-10-02 12:47:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:21,715 INFO L93 Difference]: Finished difference Result 188112 states and 297320 transitions. [2019-10-02 12:47:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:47:21,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-10-02 12:47:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:22,143 INFO L225 Difference]: With dead ends: 188112 [2019-10-02 12:47:22,143 INFO L226 Difference]: Without dead ends: 123653 [2019-10-02 12:47:22,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:47:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123653 states. [2019-10-02 12:47:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123653 to 122813. [2019-10-02 12:47:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122813 states. [2019-10-02 12:47:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122813 states to 122813 states and 192933 transitions. [2019-10-02 12:47:30,527 INFO L78 Accepts]: Start accepts. Automaton has 122813 states and 192933 transitions. Word has length 322 [2019-10-02 12:47:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:30,528 INFO L475 AbstractCegarLoop]: Abstraction has 122813 states and 192933 transitions. [2019-10-02 12:47:30,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:47:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 122813 states and 192933 transitions. [2019-10-02 12:47:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 12:47:30,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:30,713 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:30,713 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1182076383, now seen corresponding path program 1 times [2019-10-02 12:47:30,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:30,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:30,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:47:30,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:30,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:47:30,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:47:30,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:47:30,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:47:30,933 INFO L87 Difference]: Start difference. First operand 122813 states and 192933 transitions. Second operand 5 states. [2019-10-02 12:47:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:43,102 INFO L93 Difference]: Finished difference Result 307675 states and 505884 transitions. [2019-10-02 12:47:43,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:47:43,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 322 [2019-10-02 12:47:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:44,185 INFO L225 Difference]: With dead ends: 307675 [2019-10-02 12:47:44,185 INFO L226 Difference]: Without dead ends: 262600 [2019-10-02 12:47:44,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:47:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262600 states. [2019-10-02 12:47:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262600 to 262104. [2019-10-02 12:47:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262104 states. [2019-10-02 12:47:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262104 states to 262104 states and 424029 transitions. [2019-10-02 12:47:57,155 INFO L78 Accepts]: Start accepts. Automaton has 262104 states and 424029 transitions. Word has length 322 [2019-10-02 12:47:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:57,156 INFO L475 AbstractCegarLoop]: Abstraction has 262104 states and 424029 transitions. [2019-10-02 12:47:57,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:47:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 262104 states and 424029 transitions. [2019-10-02 12:47:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-02 12:47:57,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:57,489 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:57,489 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 614133982, now seen corresponding path program 1 times [2019-10-02 12:47:57,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:57,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:57,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:57,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-10-02 12:47:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:47:57,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:47:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:47:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:47:57,680 INFO L87 Difference]: Start difference. First operand 262104 states and 424029 transitions. Second operand 6 states. [2019-10-02 12:48:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:25,586 INFO L93 Difference]: Finished difference Result 703389 states and 1173813 transitions. [2019-10-02 12:48:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:48:25,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 324 [2019-10-02 12:48:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:28,067 INFO L225 Difference]: With dead ends: 703389 [2019-10-02 12:48:28,067 INFO L226 Difference]: Without dead ends: 527974 [2019-10-02 12:48:28,585 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:48:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527974 states. [2019-10-02 12:49:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527974 to 522931. [2019-10-02 12:49:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522931 states. [2019-10-02 12:49:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522931 states to 522931 states and 856149 transitions. [2019-10-02 12:49:09,045 INFO L78 Accepts]: Start accepts. Automaton has 522931 states and 856149 transitions. Word has length 324 [2019-10-02 12:49:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:09,045 INFO L475 AbstractCegarLoop]: Abstraction has 522931 states and 856149 transitions. [2019-10-02 12:49:09,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:49:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 522931 states and 856149 transitions. [2019-10-02 12:49:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 12:49:20,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:20,090 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:20,091 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1369290199, now seen corresponding path program 1 times [2019-10-02 12:49:20,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:20,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:20,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 12:49:20,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:20,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:49:20,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:49:20,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:49:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:49:20,243 INFO L87 Difference]: Start difference. First operand 522931 states and 856149 transitions. Second operand 3 states. [2019-10-02 12:49:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:58,830 INFO L93 Difference]: Finished difference Result 1292345 states and 2288427 transitions. [2019-10-02 12:49:58,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:49:58,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-02 12:49:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:50:02,196 INFO L225 Difference]: With dead ends: 1292345 [2019-10-02 12:50:02,196 INFO L226 Difference]: Without dead ends: 768797 [2019-10-02 12:50:04,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:50:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768797 states. [2019-10-02 12:51:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768797 to 768752. [2019-10-02 12:51:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768752 states.