./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8be154d3e1e3530184c878a0d9a3b350197adb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:46:50,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:46:50,275 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:46:50,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:46:50,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:46:50,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:46:50,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:46:50,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:46:50,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:46:50,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:46:50,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:46:50,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:46:50,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:46:50,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:46:50,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:46:50,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:46:50,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:46:50,293 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:46:50,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:46:50,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:46:50,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:46:50,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:46:50,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:46:50,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:46:50,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:46:50,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:46:50,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:46:50,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:46:50,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:46:50,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:46:50,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:46:50,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:46:50,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:46:50,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:46:50,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:46:50,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:46:50,306 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:46:50,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:46:50,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:46:50,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:46:50,317 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:46:50,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:46:50,318 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:46:50,318 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:46:50,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:46:50,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:46:50,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:46:50,319 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:46:50,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:46:50,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:46:50,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:46:50,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:46:50,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:46:50,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:46:50,320 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:46:50,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:46:50,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:46:50,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:46:50,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:46:50,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:46:50,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:46:50,322 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8be154d3e1e3530184c878a0d9a3b350197adb1 [2018-11-28 11:46:50,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:46:50,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:46:50,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:46:50,358 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:46:50,358 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:46:50,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c [2018-11-28 11:46:50,398 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/data/254060f2e/365fc0d6902e48bea51a8b07fd369ed6/FLAG8c24367c3 [2018-11-28 11:46:50,809 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:46:50,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/sv-benchmarks/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c [2018-11-28 11:46:50,822 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/data/254060f2e/365fc0d6902e48bea51a8b07fd369ed6/FLAG8c24367c3 [2018-11-28 11:46:50,831 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/data/254060f2e/365fc0d6902e48bea51a8b07fd369ed6 [2018-11-28 11:46:50,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:46:50,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:46:50,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:46:50,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:46:50,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:46:50,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:46:50" (1/1) ... [2018-11-28 11:46:50,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272dbe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:50, skipping insertion in model container [2018-11-28 11:46:50,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:46:50" (1/1) ... [2018-11-28 11:46:50,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:46:50,883 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:46:51,311 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:46:51,324 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:46:51,406 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:46:51,453 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:46:51,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51 WrapperNode [2018-11-28 11:46:51,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:46:51,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:46:51,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:46:51,455 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:46:51,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:46:51,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:46:51,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:46:51,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:46:51,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... [2018-11-28 11:46:51,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:46:51,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:46:51,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:46:51,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:46:51,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/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 [2018-11-28 11:46:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2018-11-28 11:46:51,598 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2018-11-28 11:46:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2018-11-28 11:46:51,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2018-11-28 11:46:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2018-11-28 11:46:51,599 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2018-11-28 11:46:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2018-11-28 11:46:51,600 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2018-11-28 11:46:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:46:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2018-11-28 11:46:51,600 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2018-11-28 11:46:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2018-11-28 11:46:51,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2018-11-28 11:46:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2018-11-28 11:46:51,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2018-11-28 11:46:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-28 11:46:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-28 11:46:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2018-11-28 11:46:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2018-11-28 11:46:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2018-11-28 11:46:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2018-11-28 11:46:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2018-11-28 11:46:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2018-11-28 11:46:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2018-11-28 11:46:51,601 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2018-11-28 11:46:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2018-11-28 11:46:51,602 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2018-11-28 11:46:51,602 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2018-11-28 11:46:51,602 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2018-11-28 11:46:51,602 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2018-11-28 11:46:51,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2018-11-28 11:46:51,602 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2018-11-28 11:46:51,602 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2018-11-28 11:46:51,602 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2018-11-28 11:46:51,602 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2018-11-28 11:46:51,603 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2018-11-28 11:46:51,603 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2018-11-28 11:46:51,603 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2018-11-28 11:46:51,603 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2018-11-28 11:46:51,603 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2018-11-28 11:46:51,603 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2018-11-28 11:46:51,603 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2018-11-28 11:46:51,603 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2018-11-28 11:46:51,603 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2018-11-28 11:46:51,603 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2018-11-28 11:46:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2018-11-28 11:46:51,604 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2018-11-28 11:46:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2018-11-28 11:46:51,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2018-11-28 11:46:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2018-11-28 11:46:51,604 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2018-11-28 11:46:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-28 11:46:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2018-11-28 11:46:51,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2018-11-28 11:46:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:46:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:46:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2018-11-28 11:46:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2018-11-28 11:46:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2018-11-28 11:46:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2018-11-28 11:46:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2018-11-28 11:46:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2018-11-28 11:46:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2018-11-28 11:46:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2018-11-28 11:46:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2018-11-28 11:46:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2018-11-28 11:46:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-28 11:46:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-28 11:46:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2018-11-28 11:46:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2018-11-28 11:46:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:46:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:46:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2018-11-28 11:46:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2018-11-28 11:46:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2018-11-28 11:46:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2018-11-28 11:46:51,606 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2018-11-28 11:46:51,606 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2018-11-28 11:46:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-28 11:46:51,607 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-28 11:46:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2018-11-28 11:46:51,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2018-11-28 11:46:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2018-11-28 11:46:51,607 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2018-11-28 11:46:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-28 11:46:51,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-28 11:46:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2018-11-28 11:46:51,607 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2018-11-28 11:46:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2018-11-28 11:46:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2018-11-28 11:46:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-28 11:46:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-28 11:46:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2018-11-28 11:46:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2018-11-28 11:46:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2018-11-28 11:46:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2018-11-28 11:46:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2018-11-28 11:46:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2018-11-28 11:46:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2018-11-28 11:46:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2018-11-28 11:46:51,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2018-11-28 11:46:51,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2018-11-28 11:46:51,609 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2018-11-28 11:46:51,609 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2018-11-28 11:46:51,609 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2018-11-28 11:46:51,609 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-28 11:46:51,610 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-28 11:46:51,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:46:51,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:46:52,516 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:46:52,516 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:46:52,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:46:52 BoogieIcfgContainer [2018-11-28 11:46:52,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:46:52,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:46:52,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:46:52,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:46:52,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:46:50" (1/3) ... [2018-11-28 11:46:52,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243b17eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:46:52, skipping insertion in model container [2018-11-28 11:46:52,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:46:51" (2/3) ... [2018-11-28 11:46:52,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243b17eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:46:52, skipping insertion in model container [2018-11-28 11:46:52,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:46:52" (3/3) ... [2018-11-28 11:46:52,522 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product12_true-unreach-call_true-termination.cil.c [2018-11-28 11:46:52,529 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:46:52,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:46:52,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:46:52,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:46:52,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:46:52,570 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:46:52,570 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:46:52,570 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:46:52,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:46:52,570 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:46:52,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:46:52,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:46:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states. [2018-11-28 11:46:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-28 11:46:52,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:52,605 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:46:52,606 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:52,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 222987738, now seen corresponding path program 1 times [2018-11-28 11:46:52,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:52,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:46:52,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:46:52,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:46:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:46:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:46:52,905 INFO L87 Difference]: Start difference. First operand 390 states. Second operand 2 states. [2018-11-28 11:46:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:52,950 INFO L93 Difference]: Finished difference Result 557 states and 745 transitions. [2018-11-28 11:46:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:46:52,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2018-11-28 11:46:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:52,964 INFO L225 Difference]: With dead ends: 557 [2018-11-28 11:46:52,964 INFO L226 Difference]: Without dead ends: 379 [2018-11-28 11:46:52,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:46:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-28 11:46:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-28 11:46:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-28 11:46:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 510 transitions. [2018-11-28 11:46:53,013 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 510 transitions. Word has length 145 [2018-11-28 11:46:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:53,015 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 510 transitions. [2018-11-28 11:46:53,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:46:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 510 transitions. [2018-11-28 11:46:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-28 11:46:53,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:53,019 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:46:53,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:53,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1036249365, now seen corresponding path program 1 times [2018-11-28 11:46:53,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:53,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:53,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:46:53,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:53,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:46:53,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:46:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:46:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:46:53,186 INFO L87 Difference]: Start difference. First operand 379 states and 510 transitions. Second operand 3 states. [2018-11-28 11:46:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:53,231 INFO L93 Difference]: Finished difference Result 540 states and 714 transitions. [2018-11-28 11:46:53,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:46:53,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-11-28 11:46:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:53,235 INFO L225 Difference]: With dead ends: 540 [2018-11-28 11:46:53,235 INFO L226 Difference]: Without dead ends: 382 [2018-11-28 11:46:53,237 INFO L631 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 [2018-11-28 11:46:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-28 11:46:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-28 11:46:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-28 11:46:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 512 transitions. [2018-11-28 11:46:53,262 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 512 transitions. Word has length 146 [2018-11-28 11:46:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:53,262 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 512 transitions. [2018-11-28 11:46:53,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:46:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 512 transitions. [2018-11-28 11:46:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-28 11:46:53,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:53,266 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:46:53,266 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:53,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1112726655, now seen corresponding path program 1 times [2018-11-28 11:46:53,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:53,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:53,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 11:46:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:46:53,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:46:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:46:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:46:53,433 INFO L87 Difference]: Start difference. First operand 381 states and 512 transitions. Second operand 3 states. [2018-11-28 11:46:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:53,472 INFO L93 Difference]: Finished difference Result 736 states and 1019 transitions. [2018-11-28 11:46:53,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:46:53,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-11-28 11:46:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:53,476 INFO L225 Difference]: With dead ends: 736 [2018-11-28 11:46:53,476 INFO L226 Difference]: Without dead ends: 420 [2018-11-28 11:46:53,477 INFO L631 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 [2018-11-28 11:46:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-11-28 11:46:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 419. [2018-11-28 11:46:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-28 11:46:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 578 transitions. [2018-11-28 11:46:53,497 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 578 transitions. Word has length 152 [2018-11-28 11:46:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:53,497 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 578 transitions. [2018-11-28 11:46:53,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:46:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 578 transitions. [2018-11-28 11:46:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-28 11:46:53,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:53,501 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:46:53,501 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:53,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 421605220, now seen corresponding path program 1 times [2018-11-28 11:46:53,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:53,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:53,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 11:46:53,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:46:53,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/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 [2018-11-28 11:46:53,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:53,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:46:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 11:46:54,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:46:54,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2018-11-28 11:46:54,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:46:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:46:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:46:54,159 INFO L87 Difference]: Start difference. First operand 419 states and 578 transitions. Second operand 13 states. [2018-11-28 11:46:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:54,885 INFO L93 Difference]: Finished difference Result 820 states and 1146 transitions. [2018-11-28 11:46:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:46:54,885 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-11-28 11:46:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:54,887 INFO L225 Difference]: With dead ends: 820 [2018-11-28 11:46:54,887 INFO L226 Difference]: Without dead ends: 437 [2018-11-28 11:46:54,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:46:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-11-28 11:46:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2018-11-28 11:46:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-11-28 11:46:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 599 transitions. [2018-11-28 11:46:54,907 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 599 transitions. Word has length 153 [2018-11-28 11:46:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:54,907 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 599 transitions. [2018-11-28 11:46:54,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:46:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 599 transitions. [2018-11-28 11:46:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-28 11:46:54,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:54,910 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:54,911 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:54,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -131387551, now seen corresponding path program 1 times [2018-11-28 11:46:54,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:54,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:54,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 11:46:55,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:55,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:46:55,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:46:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:46:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:46:55,078 INFO L87 Difference]: Start difference. First operand 435 states and 599 transitions. Second operand 7 states. [2018-11-28 11:46:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:55,231 INFO L93 Difference]: Finished difference Result 818 states and 1135 transitions. [2018-11-28 11:46:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:46:55,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2018-11-28 11:46:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:55,234 INFO L225 Difference]: With dead ends: 818 [2018-11-28 11:46:55,234 INFO L226 Difference]: Without dead ends: 449 [2018-11-28 11:46:55,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:46:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-28 11:46:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 445. [2018-11-28 11:46:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-11-28 11:46:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 610 transitions. [2018-11-28 11:46:55,253 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 610 transitions. Word has length 155 [2018-11-28 11:46:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:55,253 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 610 transitions. [2018-11-28 11:46:55,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:46:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 610 transitions. [2018-11-28 11:46:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-28 11:46:55,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:55,256 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:55,256 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:55,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash -370658920, now seen corresponding path program 2 times [2018-11-28 11:46:55,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:55,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:55,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 11:46:55,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:55,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:46:55,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:46:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:46:55,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:46:55,370 INFO L87 Difference]: Start difference. First operand 445 states and 610 transitions. Second operand 7 states. [2018-11-28 11:46:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:55,513 INFO L93 Difference]: Finished difference Result 816 states and 1134 transitions. [2018-11-28 11:46:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:46:55,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2018-11-28 11:46:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:55,516 INFO L225 Difference]: With dead ends: 816 [2018-11-28 11:46:55,516 INFO L226 Difference]: Without dead ends: 451 [2018-11-28 11:46:55,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:46:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-28 11:46:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-11-28 11:46:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-28 11:46:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 613 transitions. [2018-11-28 11:46:55,535 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 613 transitions. Word has length 156 [2018-11-28 11:46:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:55,535 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 613 transitions. [2018-11-28 11:46:55,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:46:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 613 transitions. [2018-11-28 11:46:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-28 11:46:55,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:55,537 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:55,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:55,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash 423790812, now seen corresponding path program 1 times [2018-11-28 11:46:55,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:55,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:55,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:46:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:46:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:55,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:46:55,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:46:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:46:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:46:55,670 INFO L87 Difference]: Start difference. First operand 447 states and 613 transitions. Second operand 9 states. [2018-11-28 11:46:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:55,857 INFO L93 Difference]: Finished difference Result 821 states and 1140 transitions. [2018-11-28 11:46:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:46:55,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2018-11-28 11:46:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:55,860 INFO L225 Difference]: With dead ends: 821 [2018-11-28 11:46:55,860 INFO L226 Difference]: Without dead ends: 449 [2018-11-28 11:46:55,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:46:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-28 11:46:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2018-11-28 11:46:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-28 11:46:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 612 transitions. [2018-11-28 11:46:55,877 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 612 transitions. Word has length 157 [2018-11-28 11:46:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:55,877 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 612 transitions. [2018-11-28 11:46:55,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:46:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 612 transitions. [2018-11-28 11:46:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-28 11:46:55,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:55,879 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:55,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:55,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1848816594, now seen corresponding path program 2 times [2018-11-28 11:46:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:46:55,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:55,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:46:55,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:46:55,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:46:55,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:46:55,998 INFO L87 Difference]: Start difference. First operand 447 states and 612 transitions. Second operand 9 states. [2018-11-28 11:46:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:56,179 INFO L93 Difference]: Finished difference Result 823 states and 1141 transitions. [2018-11-28 11:46:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:46:56,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2018-11-28 11:46:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:56,182 INFO L225 Difference]: With dead ends: 823 [2018-11-28 11:46:56,182 INFO L226 Difference]: Without dead ends: 451 [2018-11-28 11:46:56,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:46:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-28 11:46:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-11-28 11:46:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-28 11:46:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 611 transitions. [2018-11-28 11:46:56,200 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 611 transitions. Word has length 158 [2018-11-28 11:46:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:56,200 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 611 transitions. [2018-11-28 11:46:56,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:46:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 611 transitions. [2018-11-28 11:46:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-28 11:46:56,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:56,202 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:56,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash 158310113, now seen corresponding path program 1 times [2018-11-28 11:46:56,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:56,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:46:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 11:46:56,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:56,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 11:46:56,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:46:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:46:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:46:56,473 INFO L87 Difference]: Start difference. First operand 447 states and 611 transitions. Second operand 17 states. [2018-11-28 11:46:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:57,760 INFO L93 Difference]: Finished difference Result 1118 states and 1534 transitions. [2018-11-28 11:46:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 11:46:57,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2018-11-28 11:46:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:57,763 INFO L225 Difference]: With dead ends: 1118 [2018-11-28 11:46:57,763 INFO L226 Difference]: Without dead ends: 978 [2018-11-28 11:46:57,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 11:46:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-11-28 11:46:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 950. [2018-11-28 11:46:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-11-28 11:46:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1321 transitions. [2018-11-28 11:46:57,793 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1321 transitions. Word has length 159 [2018-11-28 11:46:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:57,794 INFO L480 AbstractCegarLoop]: Abstraction has 950 states and 1321 transitions. [2018-11-28 11:46:57,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:46:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1321 transitions. [2018-11-28 11:46:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-28 11:46:57,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:57,797 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:57,797 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:57,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash 417832863, now seen corresponding path program 1 times [2018-11-28 11:46:57,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:57,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:57,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 11:46:57,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:57,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:46:57,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:46:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:46:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:46:57,881 INFO L87 Difference]: Start difference. First operand 950 states and 1321 transitions. Second operand 5 states. [2018-11-28 11:46:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:58,252 INFO L93 Difference]: Finished difference Result 2177 states and 2980 transitions. [2018-11-28 11:46:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:46:58,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-28 11:46:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:58,258 INFO L225 Difference]: With dead ends: 2177 [2018-11-28 11:46:58,258 INFO L226 Difference]: Without dead ends: 1894 [2018-11-28 11:46:58,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:46:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2018-11-28 11:46:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1876. [2018-11-28 11:46:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2018-11-28 11:46:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2592 transitions. [2018-11-28 11:46:58,317 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2592 transitions. Word has length 160 [2018-11-28 11:46:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:58,318 INFO L480 AbstractCegarLoop]: Abstraction has 1876 states and 2592 transitions. [2018-11-28 11:46:58,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:46:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2592 transitions. [2018-11-28 11:46:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-28 11:46:58,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:58,322 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:46:58,322 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:58,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1592270978, now seen corresponding path program 1 times [2018-11-28 11:46:58,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:58,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:58,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:58,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:58,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:58,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:46:58,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:46:58,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:58,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:46:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:58,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:46:58,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 11:46:58,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:46:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:46:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:46:58,662 INFO L87 Difference]: Start difference. First operand 1876 states and 2592 transitions. Second operand 5 states. [2018-11-28 11:46:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:58,740 INFO L93 Difference]: Finished difference Result 3135 states and 4233 transitions. [2018-11-28 11:46:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:46:58,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-28 11:46:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:58,746 INFO L225 Difference]: With dead ends: 3135 [2018-11-28 11:46:58,746 INFO L226 Difference]: Without dead ends: 1944 [2018-11-28 11:46:58,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:46:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2018-11-28 11:46:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1792. [2018-11-28 11:46:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2018-11-28 11:46:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2502 transitions. [2018-11-28 11:46:58,807 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2502 transitions. Word has length 160 [2018-11-28 11:46:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:58,807 INFO L480 AbstractCegarLoop]: Abstraction has 1792 states and 2502 transitions. [2018-11-28 11:46:58,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:46:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2502 transitions. [2018-11-28 11:46:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-28 11:46:58,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:58,810 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:46:58,810 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:58,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1509568795, now seen corresponding path program 1 times [2018-11-28 11:46:58,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:58,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:58,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:58,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:46:58,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:46:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:46:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:46:58,875 INFO L87 Difference]: Start difference. First operand 1792 states and 2502 transitions. Second operand 3 states. [2018-11-28 11:46:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:58,925 INFO L93 Difference]: Finished difference Result 3716 states and 5316 transitions. [2018-11-28 11:46:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:46:58,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-11-28 11:46:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:58,931 INFO L225 Difference]: With dead ends: 3716 [2018-11-28 11:46:58,931 INFO L226 Difference]: Without dead ends: 2028 [2018-11-28 11:46:58,935 INFO L631 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 [2018-11-28 11:46:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2018-11-28 11:46:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 2025. [2018-11-28 11:46:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2018-11-28 11:46:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2926 transitions. [2018-11-28 11:46:58,999 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2926 transitions. Word has length 166 [2018-11-28 11:46:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:58,999 INFO L480 AbstractCegarLoop]: Abstraction has 2025 states and 2926 transitions. [2018-11-28 11:46:58,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:46:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2926 transitions. [2018-11-28 11:46:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-28 11:46:59,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:59,003 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:46:59,003 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:59,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -692471752, now seen corresponding path program 1 times [2018-11-28 11:46:59,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:59,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:59,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:59,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:46:59,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:46:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:46:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:46:59,067 INFO L87 Difference]: Start difference. First operand 2025 states and 2926 transitions. Second operand 3 states. [2018-11-28 11:46:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:59,124 INFO L93 Difference]: Finished difference Result 4377 states and 6531 transitions. [2018-11-28 11:46:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:46:59,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-11-28 11:46:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:59,131 INFO L225 Difference]: With dead ends: 4377 [2018-11-28 11:46:59,131 INFO L226 Difference]: Without dead ends: 2462 [2018-11-28 11:46:59,135 INFO L631 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 [2018-11-28 11:46:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2018-11-28 11:46:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2459. [2018-11-28 11:46:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2018-11-28 11:46:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3719 transitions. [2018-11-28 11:46:59,207 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3719 transitions. Word has length 167 [2018-11-28 11:46:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:59,207 INFO L480 AbstractCegarLoop]: Abstraction has 2459 states and 3719 transitions. [2018-11-28 11:46:59,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:46:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3719 transitions. [2018-11-28 11:46:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-28 11:46:59,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:59,212 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-11-28 11:46:59,213 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 21465383, now seen corresponding path program 2 times [2018-11-28 11:46:59,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:59,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:59,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:59,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:46:59,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:46:59,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:46:59,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:46:59,318 INFO L87 Difference]: Start difference. First operand 2459 states and 3719 transitions. Second operand 6 states. [2018-11-28 11:46:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:59,438 INFO L93 Difference]: Finished difference Result 4767 states and 7238 transitions. [2018-11-28 11:46:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:46:59,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-11-28 11:46:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:59,444 INFO L225 Difference]: With dead ends: 4767 [2018-11-28 11:46:59,444 INFO L226 Difference]: Without dead ends: 2462 [2018-11-28 11:46:59,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:46:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2018-11-28 11:46:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2459. [2018-11-28 11:46:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2018-11-28 11:46:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3707 transitions. [2018-11-28 11:46:59,516 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3707 transitions. Word has length 167 [2018-11-28 11:46:59,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:59,516 INFO L480 AbstractCegarLoop]: Abstraction has 2459 states and 3707 transitions. [2018-11-28 11:46:59,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:46:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3707 transitions. [2018-11-28 11:46:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-28 11:46:59,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:59,521 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:46:59,522 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:59,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash -212892263, now seen corresponding path program 1 times [2018-11-28 11:46:59,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:46:59,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:59,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:46:59,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:46:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:46:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:46:59,581 INFO L87 Difference]: Start difference. First operand 2459 states and 3707 transitions. Second operand 3 states. [2018-11-28 11:46:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:59,657 INFO L93 Difference]: Finished difference Result 5637 states and 8781 transitions. [2018-11-28 11:46:59,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:46:59,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-11-28 11:46:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:59,665 INFO L225 Difference]: With dead ends: 5637 [2018-11-28 11:46:59,665 INFO L226 Difference]: Without dead ends: 3296 [2018-11-28 11:46:59,670 INFO L631 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 [2018-11-28 11:46:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2018-11-28 11:46:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3293. [2018-11-28 11:46:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2018-11-28 11:46:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 5188 transitions. [2018-11-28 11:46:59,762 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 5188 transitions. Word has length 168 [2018-11-28 11:46:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:46:59,763 INFO L480 AbstractCegarLoop]: Abstraction has 3293 states and 5188 transitions. [2018-11-28 11:46:59,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:46:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 5188 transitions. [2018-11-28 11:46:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-28 11:46:59,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:46:59,770 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:46:59,770 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:46:59,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:46:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1548767736, now seen corresponding path program 1 times [2018-11-28 11:46:59,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:46:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:46:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:46:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:46:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:46:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:46:59,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:46:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:46:59,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:46:59,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:46:59,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:46:59,835 INFO L87 Difference]: Start difference. First operand 3293 states and 5188 transitions. Second operand 3 states. [2018-11-28 11:46:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:46:59,944 INFO L93 Difference]: Finished difference Result 8049 states and 13059 transitions. [2018-11-28 11:46:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:46:59,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-11-28 11:46:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:46:59,957 INFO L225 Difference]: With dead ends: 8049 [2018-11-28 11:46:59,958 INFO L226 Difference]: Without dead ends: 4886 [2018-11-28 11:46:59,964 INFO L631 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 [2018-11-28 11:46:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2018-11-28 11:47:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4883. [2018-11-28 11:47:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4883 states. [2018-11-28 11:47:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 7977 transitions. [2018-11-28 11:47:00,100 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 7977 transitions. Word has length 169 [2018-11-28 11:47:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:00,100 INFO L480 AbstractCegarLoop]: Abstraction has 4883 states and 7977 transitions. [2018-11-28 11:47:00,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 7977 transitions. [2018-11-28 11:47:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-28 11:47:00,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:00,110 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:00,110 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:00,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1066930215, now seen corresponding path program 1 times [2018-11-28 11:47:00,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:00,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:00,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:00,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:00,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:00,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:00,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:00,175 INFO L87 Difference]: Start difference. First operand 4883 states and 7977 transitions. Second operand 3 states. [2018-11-28 11:47:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:00,369 INFO L93 Difference]: Finished difference Result 12849 states and 21504 transitions. [2018-11-28 11:47:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-11-28 11:47:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:00,401 INFO L225 Difference]: With dead ends: 12849 [2018-11-28 11:47:00,401 INFO L226 Difference]: Without dead ends: 8104 [2018-11-28 11:47:00,411 INFO L631 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 [2018-11-28 11:47:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2018-11-28 11:47:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 8101. [2018-11-28 11:47:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8101 states. [2018-11-28 11:47:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8101 states to 8101 states and 13594 transitions. [2018-11-28 11:47:00,640 INFO L78 Accepts]: Start accepts. Automaton has 8101 states and 13594 transitions. Word has length 170 [2018-11-28 11:47:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:00,640 INFO L480 AbstractCegarLoop]: Abstraction has 8101 states and 13594 transitions. [2018-11-28 11:47:00,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 13594 transitions. [2018-11-28 11:47:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-28 11:47:00,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:00,656 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:00,656 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:00,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:00,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2118130760, now seen corresponding path program 1 times [2018-11-28 11:47:00,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:00,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:00,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:00,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:00,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:00,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:00,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:00,719 INFO L87 Difference]: Start difference. First operand 8101 states and 13594 transitions. Second operand 3 states. [2018-11-28 11:47:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:01,030 INFO L93 Difference]: Finished difference Result 22015 states and 37578 transitions. [2018-11-28 11:47:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:01,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-11-28 11:47:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:01,082 INFO L225 Difference]: With dead ends: 22015 [2018-11-28 11:47:01,082 INFO L226 Difference]: Without dead ends: 14058 [2018-11-28 11:47:01,109 INFO L631 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 [2018-11-28 11:47:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14058 states. [2018-11-28 11:47:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14058 to 14055. [2018-11-28 11:47:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14055 states. [2018-11-28 11:47:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14055 states to 14055 states and 23963 transitions. [2018-11-28 11:47:01,590 INFO L78 Accepts]: Start accepts. Automaton has 14055 states and 23963 transitions. Word has length 171 [2018-11-28 11:47:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:01,591 INFO L480 AbstractCegarLoop]: Abstraction has 14055 states and 23963 transitions. [2018-11-28 11:47:01,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14055 states and 23963 transitions. [2018-11-28 11:47:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-28 11:47:01,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:01,611 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:01,611 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:01,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1091437673, now seen corresponding path program 1 times [2018-11-28 11:47:01,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:01,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:01,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:01,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:01,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:01,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:01,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:01,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:01,672 INFO L87 Difference]: Start difference. First operand 14055 states and 23963 transitions. Second operand 3 states. [2018-11-28 11:47:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:02,287 INFO L93 Difference]: Finished difference Result 40063 states and 68871 transitions. [2018-11-28 11:47:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:02,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-11-28 11:47:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:02,342 INFO L225 Difference]: With dead ends: 40063 [2018-11-28 11:47:02,343 INFO L226 Difference]: Without dead ends: 26156 [2018-11-28 11:47:02,362 INFO L631 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 [2018-11-28 11:47:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26156 states. [2018-11-28 11:47:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26156 to 26153. [2018-11-28 11:47:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26153 states. [2018-11-28 11:47:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26153 states to 26153 states and 44700 transitions. [2018-11-28 11:47:03,051 INFO L78 Accepts]: Start accepts. Automaton has 26153 states and 44700 transitions. Word has length 172 [2018-11-28 11:47:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:03,051 INFO L480 AbstractCegarLoop]: Abstraction has 26153 states and 44700 transitions. [2018-11-28 11:47:03,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 26153 states and 44700 transitions. [2018-11-28 11:47:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-28 11:47:03,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:03,084 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-28 11:47:03,084 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:03,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1299614935, now seen corresponding path program 1 times [2018-11-28 11:47:03,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:03,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:03,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-28 11:47:03,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:47:03,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:47:03,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:03,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:47:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-28 11:47:03,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:47:03,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 11:47:03,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:47:03,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:47:03,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:47:03,515 INFO L87 Difference]: Start difference. First operand 26153 states and 44700 transitions. Second operand 6 states. [2018-11-28 11:47:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:04,048 INFO L93 Difference]: Finished difference Result 28153 states and 47546 transitions. [2018-11-28 11:47:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:47:04,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-28 11:47:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:04,130 INFO L225 Difference]: With dead ends: 28153 [2018-11-28 11:47:04,130 INFO L226 Difference]: Without dead ends: 27107 [2018-11-28 11:47:04,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:47:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27107 states. [2018-11-28 11:47:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27107 to 27012. [2018-11-28 11:47:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27012 states. [2018-11-28 11:47:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27012 states to 27012 states and 46022 transitions. [2018-11-28 11:47:05,047 INFO L78 Accepts]: Start accepts. Automaton has 27012 states and 46022 transitions. Word has length 178 [2018-11-28 11:47:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:05,047 INFO L480 AbstractCegarLoop]: Abstraction has 27012 states and 46022 transitions. [2018-11-28 11:47:05,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:47:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27012 states and 46022 transitions. [2018-11-28 11:47:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-28 11:47:05,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:05,071 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:05,072 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:05,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 616013112, now seen corresponding path program 1 times [2018-11-28 11:47:05,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:05,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:05,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:05,149 INFO L87 Difference]: Start difference. First operand 27012 states and 46022 transitions. Second operand 3 states. [2018-11-28 11:47:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:06,408 INFO L93 Difference]: Finished difference Result 75745 states and 129266 transitions. [2018-11-28 11:47:06,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:06,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-11-28 11:47:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:06,512 INFO L225 Difference]: With dead ends: 75745 [2018-11-28 11:47:06,513 INFO L226 Difference]: Without dead ends: 49455 [2018-11-28 11:47:06,563 INFO L631 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 [2018-11-28 11:47:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49455 states. [2018-11-28 11:47:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49455 to 49452. [2018-11-28 11:47:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49452 states. [2018-11-28 11:47:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49452 states to 49452 states and 83492 transitions. [2018-11-28 11:47:08,096 INFO L78 Accepts]: Start accepts. Automaton has 49452 states and 83492 transitions. Word has length 173 [2018-11-28 11:47:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:08,097 INFO L480 AbstractCegarLoop]: Abstraction has 49452 states and 83492 transitions. [2018-11-28 11:47:08,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 49452 states and 83492 transitions. [2018-11-28 11:47:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-28 11:47:08,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:08,131 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:08,132 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:08,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1242554603, now seen corresponding path program 1 times [2018-11-28 11:47:08,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:08,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:08,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:08,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:08,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:08,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:08,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:08,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:08,233 INFO L87 Difference]: Start difference. First operand 49452 states and 83492 transitions. Second operand 3 states. [2018-11-28 11:47:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:10,568 INFO L93 Difference]: Finished difference Result 140303 states and 237959 transitions. [2018-11-28 11:47:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:10,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-28 11:47:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:10,756 INFO L225 Difference]: With dead ends: 140303 [2018-11-28 11:47:10,756 INFO L226 Difference]: Without dead ends: 91783 [2018-11-28 11:47:10,824 INFO L631 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 [2018-11-28 11:47:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91783 states. [2018-11-28 11:47:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91783 to 91780. [2018-11-28 11:47:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91780 states. [2018-11-28 11:47:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91780 states to 91780 states and 154244 transitions. [2018-11-28 11:47:13,606 INFO L78 Accepts]: Start accepts. Automaton has 91780 states and 154244 transitions. Word has length 174 [2018-11-28 11:47:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:13,607 INFO L480 AbstractCegarLoop]: Abstraction has 91780 states and 154244 transitions. [2018-11-28 11:47:13,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 91780 states and 154244 transitions. [2018-11-28 11:47:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-28 11:47:13,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:13,642 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:13,642 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:13,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:13,642 INFO L82 PathProgramCache]: Analyzing trace with hash 735018616, now seen corresponding path program 1 times [2018-11-28 11:47:13,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:13,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:13,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:13,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:13,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:13,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:13,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:13,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:13,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:13,733 INFO L87 Difference]: Start difference. First operand 91780 states and 154244 transitions. Second operand 3 states. [2018-11-28 11:47:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:19,365 INFO L93 Difference]: Finished difference Result 172851 states and 287894 transitions. [2018-11-28 11:47:19,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:19,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-28 11:47:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:19,736 INFO L225 Difference]: With dead ends: 172851 [2018-11-28 11:47:19,736 INFO L226 Difference]: Without dead ends: 171805 [2018-11-28 11:47:19,766 INFO L631 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 [2018-11-28 11:47:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171805 states. [2018-11-28 11:47:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171805 to 171802. [2018-11-28 11:47:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171802 states. [2018-11-28 11:47:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171802 states to 171802 states and 283459 transitions. [2018-11-28 11:47:25,119 INFO L78 Accepts]: Start accepts. Automaton has 171802 states and 283459 transitions. Word has length 175 [2018-11-28 11:47:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:25,120 INFO L480 AbstractCegarLoop]: Abstraction has 171802 states and 283459 transitions. [2018-11-28 11:47:25,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 171802 states and 283459 transitions. [2018-11-28 11:47:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-28 11:47:25,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:25,173 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:47:25,173 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:25,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 91828693, now seen corresponding path program 1 times [2018-11-28 11:47:25,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:25,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:25,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-28 11:47:25,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:25,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:47:25,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:47:25,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:47:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:25,268 INFO L87 Difference]: Start difference. First operand 171802 states and 283459 transitions. Second operand 3 states. [2018-11-28 11:47:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:29,752 INFO L93 Difference]: Finished difference Result 173181 states and 285302 transitions. [2018-11-28 11:47:29,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:47:29,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-28 11:47:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:30,176 INFO L225 Difference]: With dead ends: 173181 [2018-11-28 11:47:30,176 INFO L226 Difference]: Without dead ends: 172203 [2018-11-28 11:47:30,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:47:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172203 states. [2018-11-28 11:47:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172203 to 172203. [2018-11-28 11:47:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172203 states. [2018-11-28 11:47:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172203 states to 172203 states and 283992 transitions. [2018-11-28 11:47:35,834 INFO L78 Accepts]: Start accepts. Automaton has 172203 states and 283992 transitions. Word has length 176 [2018-11-28 11:47:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:35,834 INFO L480 AbstractCegarLoop]: Abstraction has 172203 states and 283992 transitions. [2018-11-28 11:47:35,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:47:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 172203 states and 283992 transitions. [2018-11-28 11:47:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-28 11:47:36,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:36,232 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:47:36,232 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:36,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:36,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1202372338, now seen corresponding path program 1 times [2018-11-28 11:47:36,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:36,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:36,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-28 11:47:36,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:36,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:47:36,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:47:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:47:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:47:36,346 INFO L87 Difference]: Start difference. First operand 172203 states and 283992 transitions. Second operand 5 states. [2018-11-28 11:47:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:41,893 INFO L93 Difference]: Finished difference Result 172602 states and 284506 transitions. [2018-11-28 11:47:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:47:41,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 268 [2018-11-28 11:47:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:42,314 INFO L225 Difference]: With dead ends: 172602 [2018-11-28 11:47:42,314 INFO L226 Difference]: Without dead ends: 171619 [2018-11-28 11:47:42,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:47:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171619 states. [2018-11-28 11:47:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171619 to 171619. [2018-11-28 11:47:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171619 states. [2018-11-28 11:47:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171619 states to 171619 states and 283230 transitions. [2018-11-28 11:47:48,170 INFO L78 Accepts]: Start accepts. Automaton has 171619 states and 283230 transitions. Word has length 268 [2018-11-28 11:47:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:48,171 INFO L480 AbstractCegarLoop]: Abstraction has 171619 states and 283230 transitions. [2018-11-28 11:47:48,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:47:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 171619 states and 283230 transitions. [2018-11-28 11:47:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-28 11:47:48,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:47:48,612 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:47:48,612 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:47:48,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:47:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash 50263818, now seen corresponding path program 1 times [2018-11-28 11:47:48,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:47:48,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:47:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:48,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:47:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:47:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:47:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 11:47:48,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:47:48,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:47:48,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:47:48,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:47:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:47:48,747 INFO L87 Difference]: Start difference. First operand 171619 states and 283230 transitions. Second operand 6 states. [2018-11-28 11:47:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:47:53,014 INFO L93 Difference]: Finished difference Result 171739 states and 283368 transitions. [2018-11-28 11:47:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:47:53,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2018-11-28 11:47:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:47:53,015 INFO L225 Difference]: With dead ends: 171739 [2018-11-28 11:47:53,015 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:47:53,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:47:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:47:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:47:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:47:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:47:53,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2018-11-28 11:47:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:47:53,231 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:47:53,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:47:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:47:53,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:47:53,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:47:53,696 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 11:48:00,107 WARN L180 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 3139 DAG size of output: 17 [2018-11-28 11:48:01,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:48:22,506 WARN L180 SmtUtils]: Spent 19.91 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:48:42,671 WARN L180 SmtUtils]: Spent 20.14 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:48:42,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:02,856 WARN L180 SmtUtils]: Spent 20.15 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:49:23,157 WARN L180 SmtUtils]: Spent 20.29 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:49:23,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:49:23,725 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2018-11-28 11:49:46,719 WARN L180 SmtUtils]: Spent 20.75 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:50:06,765 WARN L180 SmtUtils]: Spent 20.03 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:50:27,850 WARN L180 SmtUtils]: Spent 21.07 s on a formula simplification. DAG size of input: 6377 DAG size of output: 15 [2018-11-28 11:50:47,966 WARN L180 SmtUtils]: Spent 20.10 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:51:08,615 WARN L180 SmtUtils]: Spent 20.04 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:51:13,752 WARN L180 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 3139 DAG size of output: 17 [2018-11-28 11:51:18,851 WARN L180 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 3141 DAG size of output: 17 [2018-11-28 11:51:23,986 WARN L180 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 3139 DAG size of output: 17 [2018-11-28 11:51:31,263 WARN L180 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 3139 DAG size of output: 17 [2018-11-28 11:51:36,331 WARN L180 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 3141 DAG size of output: 17 [2018-11-28 11:51:42,402 WARN L180 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 3139 DAG size of output: 17 [2018-11-28 11:51:43,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 11:52:03,282 WARN L180 SmtUtils]: Spent 20.05 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:52:24,022 WARN L180 SmtUtils]: Spent 20.34 s on a formula simplification. DAG size of input: 6214 DAG size of output: 15 [2018-11-28 11:52:29,123 WARN L180 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 3141 DAG size of output: 17 [2018-11-28 11:52:30,334 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 26 [2018-11-28 11:52:32,502 INFO L448 ceAbstractionStarter]: For program point bobKeyChangeFINAL(lines 568 577) no Hoare annotation was computed. [2018-11-28 11:52:32,502 INFO L448 ceAbstractionStarter]: For program point bobKeyChangeEXIT(lines 568 577) no Hoare annotation was computed. [2018-11-28 11:52:32,503 INFO L451 ceAbstractionStarter]: At program point bobKeyChangeENTRY(lines 568 577) the Hoare annotation is: true [2018-11-28 11:52:32,503 INFO L444 ceAbstractionStarter]: At program point mailENTRY(lines 1679 1695) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,503 INFO L451 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: true [2018-11-28 11:52:32,503 INFO L448 ceAbstractionStarter]: For program point mailEXIT(lines 1679 1695) no Hoare annotation was computed. [2018-11-28 11:52:32,503 INFO L451 ceAbstractionStarter]: At program point L1690(line 1690) the Hoare annotation is: true [2018-11-28 11:52:32,503 INFO L448 ceAbstractionStarter]: For program point L1690-1(line 1690) no Hoare annotation was computed. [2018-11-28 11:52:32,503 INFO L444 ceAbstractionStarter]: At program point L1688(line 1688) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,503 INFO L448 ceAbstractionStarter]: For program point L1688-1(line 1688) no Hoare annotation was computed. [2018-11-28 11:52:32,503 INFO L448 ceAbstractionStarter]: For program point mailFINAL(lines 1679 1695) no Hoare annotation was computed. [2018-11-28 11:52:32,503 INFO L448 ceAbstractionStarter]: For program point valid_productEXIT(lines 299 307) no Hoare annotation was computed. [2018-11-28 11:52:32,503 INFO L451 ceAbstractionStarter]: At program point valid_productENTRY(lines 299 307) the Hoare annotation is: true [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point valid_productFINAL(lines 299 307) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point get_queued_clientEXIT(lines 1843 1851) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L451 ceAbstractionStarter]: At program point get_queued_clientENTRY(lines 1843 1851) the Hoare annotation is: true [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point get_queued_clientFINAL(lines 1843 1851) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point isKeyPairValidEXIT(lines 1861 1885) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point L1870(lines 1870 1880) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L451 ceAbstractionStarter]: At program point isKeyPairValidENTRY(lines 1861 1885) the Hoare annotation is: true [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point isKeyPairValidFINAL(lines 1861 1885) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point L1874(lines 1874 1879) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 455 475) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (and (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 455 475) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L444 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (and (= main_~tmp~2 1) (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,504 INFO L444 ceAbstractionStarter]: At program point L467-1(line 467) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (and (<= 3 ~chuck~0) (= main_~tmp~2 1) (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (<= 2 ~rjh~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 472) no Hoare annotation was computed. [2018-11-28 11:52:32,504 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 465 472) no Hoare annotation was computed. [2018-11-28 11:52:32,505 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-28 11:52:32,505 INFO L444 ceAbstractionStarter]: At program point L462(line 462) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (and (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,505 INFO L444 ceAbstractionStarter]: At program point L461(line 461) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (and (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,505 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 455 475) no Hoare annotation was computed. [2018-11-28 11:52:32,505 INFO L444 ceAbstractionStarter]: At program point L461-1(line 461) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (and (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,505 INFO L451 ceAbstractionStarter]: At program point rjhKeyChangeENTRY(lines 578 587) the Hoare annotation is: true [2018-11-28 11:52:32,505 INFO L448 ceAbstractionStarter]: For program point rjhKeyChangeEXIT(lines 578 587) no Hoare annotation was computed. [2018-11-28 11:52:32,505 INFO L448 ceAbstractionStarter]: For program point rjhKeyChangeFINAL(lines 578 587) no Hoare annotation was computed. [2018-11-28 11:52:32,505 INFO L448 ceAbstractionStarter]: For program point setup_rjhFINAL(lines 366 376) no Hoare annotation was computed. [2018-11-28 11:52:32,505 INFO L451 ceAbstractionStarter]: At program point setup_rjhENTRY(lines 366 376) the Hoare annotation is: true [2018-11-28 11:52:32,505 INFO L444 ceAbstractionStarter]: At program point L371(line 371) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= |setup_rjh_#in~rjh___0| setup_rjh_~rjh___0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,505 INFO L444 ceAbstractionStarter]: At program point L371-1(line 371) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= |setup_rjh_#in~rjh___0| setup_rjh_~rjh___0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,505 INFO L448 ceAbstractionStarter]: For program point setup_rjhEXIT(lines 366 376) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L451 ceAbstractionStarter]: At program point getClientPrivateKeyENTRY(lines 1182 1205) the Hoare annotation is: true [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point getClientPrivateKeyEXIT(lines 1182 1205) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point L1194(lines 1194 1200) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point getClientPrivateKeyFINAL(lines 1182 1205) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1201) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point L1186(lines 1186 1202) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point rjhKeyAddFINAL(lines 498 509) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point rjhKeyAddEXIT(lines 498 509) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L444 ceAbstractionStarter]: At program point L504(line 504) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,506 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-28 11:52:32,506 INFO L451 ceAbstractionStarter]: At program point L504-1(line 504) the Hoare annotation is: true [2018-11-28 11:52:32,506 INFO L444 ceAbstractionStarter]: At program point rjhKeyAddENTRY(lines 498 509) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,506 INFO L444 ceAbstractionStarter]: At program point L415(line 415) the Hoare annotation is: (or (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,506 INFO L444 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (or (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 398 420) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (or (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 417) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L444 ceAbstractionStarter]: At program point L406(line 406) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,507 INFO L444 ceAbstractionStarter]: At program point L406-1(line 406) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (not (= ~__ste_email_to0~0 0)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point bobToRjhEXIT(lines 398 420) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L444 ceAbstractionStarter]: At program point bobToRjhENTRY(lines 398 420) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,507 INFO L451 ceAbstractionStarter]: At program point setEmailEncryptionKeyENTRY(lines 2175 2190) the Hoare annotation is: true [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point setEmailEncryptionKeyEXIT(lines 2175 2190) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L2182(lines 2182 2186) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L2182-2(lines 2175 2190) no Hoare annotation was computed. [2018-11-28 11:52:32,507 INFO L448 ceAbstractionStarter]: For program point L2179(lines 2179 2187) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point L350(line 350) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point L350-1(line 350) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point setup_bobENTRY(lines 345 355) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point setup_bobFINAL(lines 345 355) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point setup_bobEXIT(lines 345 355) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point select_featuresEXIT(lines 285 291) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point select_featuresFINAL(lines 285 291) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point setup_bob__wrappee__BaseFINAL(lines 335 344) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point setup_bob__wrappee__BaseENTRY(lines 335 344) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point L340(line 340) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point setup_bob__wrappee__BaseEXIT(lines 335 344) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point L2160(lines 2160 2171) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point getEmailEncryptionKeyEXIT(lines 2156 2174) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point L2164(lines 2164 2170) no Hoare annotation was computed. [2018-11-28 11:52:32,508 INFO L451 ceAbstractionStarter]: At program point getEmailEncryptionKeyENTRY(lines 2156 2174) the Hoare annotation is: true [2018-11-28 11:52:32,508 INFO L448 ceAbstractionStarter]: For program point getEmailEncryptionKeyFINAL(lines 2156 2174) no Hoare annotation was computed. [2018-11-28 11:52:32,509 INFO L444 ceAbstractionStarter]: At program point outgoing__wrappee__KeysENTRY(lines 1696 1707) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,509 INFO L448 ceAbstractionStarter]: For program point outgoing__wrappee__KeysEXIT(lines 1696 1707) no Hoare annotation was computed. [2018-11-28 11:52:32,509 INFO L448 ceAbstractionStarter]: For program point outgoing__wrappee__KeysFINAL(lines 1696 1707) no Hoare annotation was computed. [2018-11-28 11:52:32,509 INFO L444 ceAbstractionStarter]: At program point L1702(line 1702) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,509 INFO L444 ceAbstractionStarter]: At program point L1701(line 1701) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,509 INFO L444 ceAbstractionStarter]: At program point L1702-1(line 1702) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,509 INFO L448 ceAbstractionStarter]: For program point L1701-1(line 1701) no Hoare annotation was computed. [2018-11-28 11:52:32,509 INFO L448 ceAbstractionStarter]: For program point incomingFINAL(lines 1755 1795) no Hoare annotation was computed. [2018-11-28 11:52:32,509 INFO L451 ceAbstractionStarter]: At program point incomingENTRY(lines 1755 1795) the Hoare annotation is: true [2018-11-28 11:52:32,509 INFO L451 ceAbstractionStarter]: At program point L1778(line 1778) the Hoare annotation is: true [2018-11-28 11:52:32,509 INFO L451 ceAbstractionStarter]: At program point L1778-1(line 1778) the Hoare annotation is: true [2018-11-28 11:52:32,509 INFO L448 ceAbstractionStarter]: For program point L1776(lines 1776 1783) no Hoare annotation was computed. [2018-11-28 11:52:32,509 INFO L451 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: true [2018-11-28 11:52:32,509 INFO L448 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L451 ceAbstractionStarter]: At program point L1764(line 1764) the Hoare annotation is: true [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point L1764-1(line 1764) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point incomingEXIT(lines 1755 1795) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L451 ceAbstractionStarter]: At program point L1773(line 1773) the Hoare annotation is: true [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point L1773-1(line 1773) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point L1771(lines 1771 1786) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L451 ceAbstractionStarter]: At program point L1769(line 1769) the Hoare annotation is: true [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point L1769-1(line 1769) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point L1767(lines 1767 1789) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L451 ceAbstractionStarter]: At program point L1767-1(lines 1767 1789) the Hoare annotation is: true [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point createEmailEXIT(lines 2783 2797) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L444 ceAbstractionStarter]: At program point L2790(line 2790) the Hoare annotation is: (or (and (= 1 createEmail_~msg~0) (<= |createEmail_#in~to| createEmail_~to)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point L2791(line 2791) no Hoare annotation was computed. [2018-11-28 11:52:32,510 INFO L444 ceAbstractionStarter]: At program point L2790-1(line 2790) the Hoare annotation is: (or (and (= 1 createEmail_~msg~0) (<= |createEmail_#in~to| createEmail_~to)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,510 INFO L451 ceAbstractionStarter]: At program point createEmailENTRY(lines 2783 2797) the Hoare annotation is: true [2018-11-28 11:52:32,510 INFO L448 ceAbstractionStarter]: For program point createEmailFINAL(lines 2783 2797) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L451 ceAbstractionStarter]: At program point rjhDeletePrivateKeyENTRY(lines 558 567) the Hoare annotation is: true [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point rjhDeletePrivateKeyEXIT(lines 558 567) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point rjhDeletePrivateKeyFINAL(lines 558 567) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L444 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (and (= (+ ~mail_is_sensitive~0 1) 0) (= test_~op10~0 0)) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point L217-1(line 217) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 158) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L444 ceAbstractionStarter]: At program point L118(lines 108 248) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 183) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 208) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L444 ceAbstractionStarter]: At program point L160(lines 147 245) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,511 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 249) no Hoare annotation was computed. [2018-11-28 11:52:32,511 INFO L444 ceAbstractionStarter]: At program point L251(lines 85 252) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,511 INFO L444 ceAbstractionStarter]: At program point L185(lines 172 243) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,512 INFO L444 ceAbstractionStarter]: At program point L210(lines 197 241) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point testEXIT(lines 47 258) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L444 ceAbstractionStarter]: At program point testENTRY(lines 47 258) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3) (and (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0))) [2018-11-28 11:52:32,512 INFO L444 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (and (= (+ ~mail_is_sensitive~0 1) 0) (= test_~op5~0 0)) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point L153-1(line 153) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point L87(lines 86 250) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point testFINAL(lines 47 258) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L444 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (and (= (+ ~mail_is_sensitive~0 1) 0) (= test_~op7~0 0)) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L444 ceAbstractionStarter]: At program point L203(line 203) the Hoare annotation is: (or (and (= (+ ~mail_is_sensitive~0 1) 0) (= test_~op9~0 0)) (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point L203-1(line 203) no Hoare annotation was computed. [2018-11-28 11:52:32,512 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-11-28 11:52:32,513 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 92) no Hoare annotation was computed. [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L146(lines 133 246) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L171(lines 161 244) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L196(lines 186 242) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L229-1(lines 86 250) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L139(line 139) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (and (= (+ ~mail_is_sensitive~0 1) 0) (= test_~op4~0 0)) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L448 ceAbstractionStarter]: For program point L139-1(line 139) no Hoare annotation was computed. [2018-11-28 11:52:32,513 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 105) no Hoare annotation was computed. [2018-11-28 11:52:32,513 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 130) no Hoare annotation was computed. [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L107(lines 94 249) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (and (= test_~op11~0 0) (= (+ ~mail_is_sensitive~0 1) 0)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,513 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L444 ceAbstractionStarter]: At program point L132(lines 119 247) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 194) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 222) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L444 ceAbstractionStarter]: At program point L100(line 100) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (and (= test_~op1~0 0) (= (+ ~mail_is_sensitive~0 1) 0)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L100-1(line 100) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L444 ceAbstractionStarter]: At program point L224(lines 211 240) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (= (+ ~mail_is_sensitive~0 1) 0) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,514 INFO L444 ceAbstractionStarter]: At program point L125(line 125) the Hoare annotation is: (or (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|)) (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (and (= (+ ~mail_is_sensitive~0 1) 0) (= test_~op3~0 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L125-1(line 125) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point getEmailToFINAL(lines 2004 2022) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L2012(lines 2012 2018) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point getEmailToEXIT(lines 2004 2022) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L448 ceAbstractionStarter]: For program point L2008(lines 2008 2019) no Hoare annotation was computed. [2018-11-28 11:52:32,514 INFO L451 ceAbstractionStarter]: At program point getEmailToENTRY(lines 2004 2022) the Hoare annotation is: true [2018-11-28 11:52:32,514 INFO L451 ceAbstractionStarter]: At program point get_queued_emailENTRY(lines 1852 1860) the Hoare annotation is: true [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point get_queued_emailFINAL(lines 1852 1860) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point get_queued_emailEXIT(lines 1852 1860) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1350) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point getClientKeyringUserEXIT(lines 1307 1360) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1311(lines 1311 1357) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1340(lines 1340 1351) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1330(lines 1330 1336) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1337) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1316(lines 1316 1322) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point getClientKeyringUserFINAL(lines 1307 1360) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1312(lines 1312 1323) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1339(lines 1339 1355) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L451 ceAbstractionStarter]: At program point getClientKeyringUserENTRY(lines 1307 1360) the Hoare annotation is: true [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1325(lines 1325 1356) no Hoare annotation was computed. [2018-11-28 11:52:32,515 INFO L448 ceAbstractionStarter]: For program point L1377(lines 1377 1385) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L444 ceAbstractionStarter]: At program point setClientKeyringUserENTRY(lines 1361 1404) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1369(lines 1369 1373) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1401) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1396) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1380(lines 1380 1384) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point setClientKeyringUserEXIT(lines 1361 1404) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1376(lines 1376 1400) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1366(lines 1366 1374) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1391(lines 1391 1395) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1387(lines 1387 1399) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L1387-1(lines 1361 1404) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L444 ceAbstractionStarter]: At program point L2817(line 2817) the Hoare annotation is: (or (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L2815-1(lines 2800 2825) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L444 ceAbstractionStarter]: At program point __utac_acc__AddressBookEncrypt_spec__1ENTRY(lines 2800 2825) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L2815(lines 2815 2821) no Hoare annotation was computed. [2018-11-28 11:52:32,516 INFO L448 ceAbstractionStarter]: For program point L2813-1(line 2813) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L444 ceAbstractionStarter]: At program point L2813(line 2813) the Hoare annotation is: (or (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point L2809-1(line 2809) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L444 ceAbstractionStarter]: At program point L2809(line 2809) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point L2807(lines 2807 2822) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point __utac_acc__AddressBookEncrypt_spec__1EXIT(lines 2800 2825) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point incoming__wrappee__EncryptFINAL(lines 1745 1754) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L451 ceAbstractionStarter]: At program point incoming__wrappee__EncryptENTRY(lines 1745 1754) the Hoare annotation is: true [2018-11-28 11:52:32,517 INFO L451 ceAbstractionStarter]: At program point L1750(line 1750) the Hoare annotation is: true [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point incoming__wrappee__EncryptEXIT(lines 1745 1754) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L451 ceAbstractionStarter]: At program point setEmailFromENTRY(lines 1986 2001) the Hoare annotation is: true [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point setEmailFromEXIT(lines 1986 2001) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point L1993(lines 1993 1997) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point L1993-2(lines 1986 2001) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point L1990(lines 1990 1998) no Hoare annotation was computed. [2018-11-28 11:52:32,517 INFO L448 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 2686 2693) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2690) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L451 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 2686 2693) the Hoare annotation is: true [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 2686 2693) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1530(lines 1530 1534) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point setClientKeyringPublicKeyEXIT(lines 1522 1565) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1526(lines 1526 1562) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1549(lines 1549 1557) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1541(lines 1541 1545) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1537(lines 1537 1561) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1527(lines 1527 1535) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L451 ceAbstractionStarter]: At program point setClientKeyringPublicKeyENTRY(lines 1522 1565) the Hoare annotation is: true [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1552(lines 1552 1556) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1548(lines 1548 1560) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1548-1(lines 1522 1565) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 1546) no Hoare annotation was computed. [2018-11-28 11:52:32,518 INFO L451 ceAbstractionStarter]: At program point setup_rjh__wrappee__BaseENTRY(lines 356 365) the Hoare annotation is: true [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point setup_rjh__wrappee__BaseFINAL(lines 356 365) no Hoare annotation was computed. [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= |setup_rjh__wrappee__Base_#in~rjh___0| setup_rjh__wrappee__Base_~rjh___0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point setup_rjh__wrappee__BaseEXIT(lines 356 365) no Hoare annotation was computed. [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point L1723(line 1723) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point L1723-1(line 1723) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point L1721(lines 1721 1728) no Hoare annotation was computed. [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point L1721-1(lines 1721 1728) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point outgoingEXIT(lines 1708 1734) no Hoare annotation was computed. [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point L1718(line 1718) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point L1718-1(line 1718) no Hoare annotation was computed. [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point outgoingENTRY(lines 1708 1734) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,519 INFO L444 ceAbstractionStarter]: At program point L1716(line 1716) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2018-11-28 11:52:32,519 INFO L448 ceAbstractionStarter]: For program point outgoingFINAL(lines 1708 1734) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L451 ceAbstractionStarter]: At program point select_helpersFINAL(lines 292 298) the Hoare annotation is: true [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point select_helpersEXIT(lines 292 298) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point getClientIdFINAL(lines 1617 1640) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1635) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L451 ceAbstractionStarter]: At program point getClientIdENTRY(lines 1617 1640) the Hoare annotation is: true [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point L1625(lines 1625 1636) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point L1621(lines 1621 1637) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point getClientIdEXIT(lines 1617 1640) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point deliverFINAL(lines 1735 1744) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L451 ceAbstractionStarter]: At program point deliverENTRY(lines 1735 1744) the Hoare annotation is: true [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point deliverEXIT(lines 1735 1744) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L451 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: true [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-11-28 11:52:32,520 INFO L448 ceAbstractionStarter]: For program point createClientKeyringEntryEXIT(lines 1273 1297) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L451 ceAbstractionStarter]: At program point L1287(line 1287) the Hoare annotation is: true [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point L1287-1(line 1287) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1294) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L451 ceAbstractionStarter]: At program point createClientKeyringEntryENTRY(lines 1273 1297) the Hoare annotation is: true [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point createClientKeyringEntryFINAL(lines 1273 1297) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point setup_chuckEXIT(lines 387 397) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L451 ceAbstractionStarter]: At program point setup_chuckENTRY(lines 387 397) the Hoare annotation is: true [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point setup_chuckFINAL(lines 387 397) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L444 ceAbstractionStarter]: At program point L392(line 392) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= |setup_chuck_#in~chuck___0| setup_chuck_~chuck___0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,521 INFO L444 ceAbstractionStarter]: At program point L392-1(line 392) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= |setup_chuck_#in~chuck___0| setup_chuck_~chuck___0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point L1505(lines 1505 1511) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point L1472(lines 1472 1518) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1512) no Hoare annotation was computed. [2018-11-28 11:52:32,521 INFO L448 ceAbstractionStarter]: For program point L1491(lines 1491 1497) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point L1487(lines 1487 1498) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point L1477(lines 1477 1483) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1484) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point L1500(lines 1500 1516) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point findPublicKeyFINAL(lines 1468 1521) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point L1486(lines 1486 1517) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point findPublicKeyEXIT(lines 1468 1521) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L451 ceAbstractionStarter]: At program point findPublicKeyENTRY(lines 1468 1521) the Hoare annotation is: true [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point sendEmailEXIT(lines 1811 1823) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L444 ceAbstractionStarter]: At program point sendEmailENTRY(lines 1811 1823) the Hoare annotation is: (or (= (+ ~mail_is_sensitive~0 1) 0) (not (= (+ |old(~mail_is_sensitive~0)| 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point sendEmailFINAL(lines 1811 1823) no Hoare annotation was computed. [2018-11-28 11:52:32,522 INFO L444 ceAbstractionStarter]: At program point L1819(line 1819) the Hoare annotation is: (let ((.cse0 (not (= (+ |old(~mail_is_sensitive~0)| 1) 0))) (.cse1 (< ~rjh~0 2)) (.cse2 (= ~queue_empty~0 0)) (.cse3 (< ~chuck~0 3))) (and (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) .cse0 .cse1 .cse2 .cse3 (and (not (= ~__ste_email_to0~0 0)) (<= 2 sendEmail_~receiver)) (< |sendEmail_#in~receiver| 2)) (or (= (+ ~mail_is_sensitive~0 1) 0) .cse0 .cse1 .cse2 .cse3))) [2018-11-28 11:52:32,522 INFO L444 ceAbstractionStarter]: At program point L1817(line 1817) the Hoare annotation is: (let ((.cse0 (not (= (+ |old(~mail_is_sensitive~0)| 1) 0))) (.cse1 (< ~rjh~0 2)) (.cse2 (= ~queue_empty~0 0)) (.cse3 (< ~chuck~0 3))) (and (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) .cse0 (<= 2 sendEmail_~receiver) .cse1 .cse2 .cse3 (< |sendEmail_#in~receiver| 2)) (or (= (+ ~mail_is_sensitive~0 1) 0) .cse0 .cse1 .cse2 .cse3))) [2018-11-28 11:52:32,522 INFO L448 ceAbstractionStarter]: For program point L1817-1(line 1817) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L2127(lines 2127 2133) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point isEncryptedFINAL(lines 2119 2137) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L2123(lines 2123 2134) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point isEncryptedEXIT(lines 2119 2137) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L451 ceAbstractionStarter]: At program point isEncryptedENTRY(lines 2119 2137) the Hoare annotation is: true [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L2145(lines 2145 2149) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L2142(lines 2142 2150) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L2145-2(lines 2138 2153) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point setEmailIsEncryptedEXIT(lines 2138 2153) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L451 ceAbstractionStarter]: At program point setEmailIsEncryptedENTRY(lines 2138 2153) the Hoare annotation is: true [2018-11-28 11:52:32,523 INFO L451 ceAbstractionStarter]: At program point setClientPrivateKeyENTRY(lines 1206 1225) the Hoare annotation is: true [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1220) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L1216-2(lines 1206 1225) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L1213(lines 1213 1221) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1222) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point setClientPrivateKeyEXIT(lines 1206 1225) no Hoare annotation was computed. [2018-11-28 11:52:32,523 INFO L448 ceAbstractionStarter]: For program point chuckKeyAddEXIT(lines 534 545) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L444 ceAbstractionStarter]: At program point L540(line 540) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L451 ceAbstractionStarter]: At program point L540-1(line 540) the Hoare annotation is: true [2018-11-28 11:52:32,524 INFO L444 ceAbstractionStarter]: At program point chuckKeyAddENTRY(lines 534 545) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point chuckKeyAddFINAL(lines 534 545) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L1233(lines 1233 1249) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L451 ceAbstractionStarter]: At program point getClientKeyringSizeENTRY(lines 1229 1252) the Hoare annotation is: true [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point getClientKeyringSizeEXIT(lines 1229 1252) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L1241(lines 1241 1247) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point getClientKeyringSizeFINAL(lines 1229 1252) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1248) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L2030(lines 2030 2034) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L2030-2(lines 2023 2038) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point L2027(lines 2027 2035) no Hoare annotation was computed. [2018-11-28 11:52:32,524 INFO L448 ceAbstractionStarter]: For program point setEmailToEXIT(lines 2023 2038) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L451 ceAbstractionStarter]: At program point setEmailToENTRY(lines 2023 2038) the Hoare annotation is: true [2018-11-28 11:52:32,525 INFO L448 ceAbstractionStarter]: For program point is_queue_emptyEXIT(lines 1834 1842) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L451 ceAbstractionStarter]: At program point is_queue_emptyENTRY(lines 1834 1842) the Hoare annotation is: true [2018-11-28 11:52:32,525 INFO L448 ceAbstractionStarter]: For program point is_queue_emptyFINAL(lines 1834 1842) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L451 ceAbstractionStarter]: At program point L491(line 491) the Hoare annotation is: true [2018-11-28 11:52:32,525 INFO L448 ceAbstractionStarter]: For program point L491-1(line 491) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L451 ceAbstractionStarter]: At program point L488(line 488) the Hoare annotation is: true [2018-11-28 11:52:32,525 INFO L448 ceAbstractionStarter]: For program point L488-1(line 488) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L448 ceAbstractionStarter]: For program point bobKeyAddEXIT(lines 476 497) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L448 ceAbstractionStarter]: For program point L486(line 486) no Hoare annotation was computed. [2018-11-28 11:52:32,525 INFO L444 ceAbstractionStarter]: At program point L485(line 485) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,525 INFO L444 ceAbstractionStarter]: At program point L484(line 484) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,525 INFO L451 ceAbstractionStarter]: At program point L485-1(line 485) the Hoare annotation is: true [2018-11-28 11:52:32,525 INFO L444 ceAbstractionStarter]: At program point bobKeyAddENTRY(lines 476 497) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L484-1(line 484) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point bobKeyAddFINAL(lines 476 497) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1437(lines 1437 1443) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point getClientKeyringPublicKeyEXIT(lines 1414 1467) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1433(lines 1433 1444) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1429) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1430) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1446(lines 1446 1462) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point getClientKeyringPublicKeyFINAL(lines 1414 1467) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L451 ceAbstractionStarter]: At program point getClientKeyringPublicKeyENTRY(lines 1414 1467) the Hoare annotation is: true [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1432(lines 1432 1463) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1457) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1418(lines 1418 1464) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point generateKeyPairFINAL(lines 1886 1895) no Hoare annotation was computed. [2018-11-28 11:52:32,526 INFO L451 ceAbstractionStarter]: At program point generateKeyPairENTRY(lines 1886 1895) the Hoare annotation is: true [2018-11-28 11:52:32,526 INFO L448 ceAbstractionStarter]: For program point generateKeyPairEXIT(lines 1886 1895) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L451 ceAbstractionStarter]: At program point L1891(line 1891) the Hoare annotation is: true [2018-11-28 11:52:32,527 INFO L444 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= |setup_chuck__wrappee__Base_#in~chuck___0| setup_chuck__wrappee__Base_~chuck___0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (< ~rjh~0 2) (= ~queue_empty~0 0) (< ~chuck~0 3)) [2018-11-28 11:52:32,527 INFO L451 ceAbstractionStarter]: At program point setup_chuck__wrappee__BaseENTRY(lines 377 386) the Hoare annotation is: true [2018-11-28 11:52:32,527 INFO L448 ceAbstractionStarter]: For program point setup_chuck__wrappee__BaseFINAL(lines 377 386) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L448 ceAbstractionStarter]: For program point setup_chuck__wrappee__BaseEXIT(lines 377 386) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:52:32,527 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L448 ceAbstractionStarter]: For program point chuckKeyAddRjhFINAL(lines 546 557) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L444 ceAbstractionStarter]: At program point chuckKeyAddRjhENTRY(lines 546 557) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,527 INFO L444 ceAbstractionStarter]: At program point L552(line 552) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~__ste_Client_Keyring0_User0~0)|))) (.cse1 (not (= (+ ~mail_is_sensitive~0 1) 0))) (.cse2 (< ~rjh~0 2)) (.cse3 (= ~queue_empty~0 0)) (.cse4 (< ~chuck~0 3))) (and (or .cse0 (= 0 ~__ste_Client_Keyring0_User0~0) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= |old(~__ste_Client_Keyring0_User0~0)| |old(~__ste_Client_Keyring0_User1~0)|)) .cse1 .cse2 .cse3 .cse4 (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0)))) [2018-11-28 11:52:32,527 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-28 11:52:32,527 INFO L451 ceAbstractionStarter]: At program point L552-1(line 552) the Hoare annotation is: true [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point chuckKeyAddRjhEXIT(lines 546 557) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L444 ceAbstractionStarter]: At program point L448(line 448) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (= ~queue_empty~0 0) (and (<= 3 ~chuck~0) (<= 2 ~rjh~0))) [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point setupEXIT(lines 432 454) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L451 ceAbstractionStarter]: At program point setupENTRY(lines 432 454) the Hoare annotation is: true [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L444 ceAbstractionStarter]: At program point L444(line 444) the Hoare annotation is: (or (not (= 0 ~__ste_Client_Keyring0_User0~0)) (<= 2 ~rjh~0) (not (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0)) (not (= (+ ~mail_is_sensitive~0 1) 0)) (= ~queue_empty~0 0)) [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point setupFINAL(lines 432 454) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point L444-1(line 444) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L451 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: true [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point L440-1(line 440) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User1~0 ~__ste_Client_Keyring0_User0~0) (not (= ~queue_empty~0 0)) (= (+ ~mail_is_sensitive~0 1) 0) (= 0 ~__ste_Client_Keyring0_User0~0)) [2018-11-28 11:52:32,528 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L448 ceAbstractionStarter]: For program point setClientKeyringSizeEXIT(lines 1253 1272) no Hoare annotation was computed. [2018-11-28 11:52:32,528 INFO L451 ceAbstractionStarter]: At program point setClientKeyringSizeENTRY(lines 1253 1272) the Hoare annotation is: true [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1263(lines 1263 1267) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1263-2(lines 1253 1272) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1260(lines 1260 1268) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1257(lines 1257 1269) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1651(lines 1651 1655) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1651-2(lines 1641 1660) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1648(lines 1648 1656) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1657) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L448 ceAbstractionStarter]: For program point setClientIdEXIT(lines 1641 1660) no Hoare annotation was computed. [2018-11-28 11:52:32,529 INFO L451 ceAbstractionStarter]: At program point setClientIdENTRY(lines 1641 1660) the Hoare annotation is: true [2018-11-28 11:52:32,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:52:32 BoogieIcfgContainer [2018-11-28 11:52:32,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:52:32,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:52:32,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:52:32,546 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:52:32,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:46:52" (3/4) ... [2018-11-28 11:52:32,553 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:52:32,562 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bobKeyChange [2018-11-28 11:52:32,562 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mail [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_client [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isKeyPairValid [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhKeyChange [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientPrivateKey [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhKeyAdd [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bobToRjh [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailEncryptionKey [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-28 11:52:32,563 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob__wrappee__Base [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailEncryptionKey [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing__wrappee__Keys [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure createEmail [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhDeletePrivateKey [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_email [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientKeyringUser [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientKeyringUser [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__AddressBookEncrypt_spec__1 [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__Encrypt [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2018-11-28 11:52:32,564 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientKeyringPublicKey [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh__wrappee__Base [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientId [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure deliver [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure createClientKeyringEntry [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure findPublicKey [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sendEmail [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isEncrypted [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailIsEncrypted [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientPrivateKey [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure chuckKeyAdd [2018-11-28 11:52:32,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientKeyringSize [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_queue_empty [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bobKeyAdd [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientKeyringPublicKey [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure generateKeyPair [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck__wrappee__Base [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure chuckKeyAddRjh [2018-11-28 11:52:32,566 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-28 11:52:32,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientKeyringSize [2018-11-28 11:52:32,567 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientId [2018-11-28 11:52:32,579 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2018-11-28 11:52:32,580 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2018-11-28 11:52:32,581 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 11:52:32,582 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 11:52:32,583 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 11:52:32,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 [2018-11-28 11:52:32,694 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_65b14dc0-d634-44b5-8744-0b86f246d32b/bin-2019/uautomizer/witness.graphml [2018-11-28 11:52:32,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:52:32,694 INFO L168 Benchmark]: Toolchain (without parser) took 341861.31 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 957.1 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,695 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:52:32,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,696 INFO L168 Benchmark]: Boogie Preprocessor took 50.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,696 INFO L168 Benchmark]: RCFGBuilder took 972.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 122.7 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,696 INFO L168 Benchmark]: TraceAbstraction took 340028.26 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 971.0 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,696 INFO L168 Benchmark]: Witness Printer took 148.22 ms. Allocated memory is still 6.3 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 241.0 kB). Peak memory consumption was 241.0 kB. Max. memory is 11.5 GB. [2018-11-28 11:52:32,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 972.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 122.7 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 340028.26 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 971.0 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. * Witness Printer took 148.22 ms. Allocated memory is still 6.3 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 241.0 kB). Peak memory consumption was 241.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2690]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((((!(0 == \old(__ste_Client_Keyring0_User0)) || mail_is_sensitive + 1 == 0) || !(\old(__ste_Client_Keyring0_User0) == \old(__ste_Client_Keyring0_User1))) || !(\old(mail_is_sensitive) + 1 == 0)) || rjh < 2) || queue_empty == 0) || chuck < 3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 56 procedures, 390 locations, 1 error locations. SAFE Result, 339.9s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 31.2s AutomataDifference, 0.0s DeadEndRemovalTime, 279.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 13894 SDtfs, 6650 SDslu, 35559 SDs, 0 SdLazy, 3561 SolverSat, 634 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 695 GetRequests, 542 SyntacticMatches, 9 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172203occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 24.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 344 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 115257 PreInvPairs, 229804 NumberOfFragments, 2390 HoareAnnotationTreeSize, 115257 FomulaSimplifications, 4188049 FormulaSimplificationTreeSizeReduction, 275.5s HoareSimplificationTime, 139 FomulaSimplificationsInter, 108070 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 4955 NumberOfCodeBlocks, 4955 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4926 ConstructedInterpolants, 0 QuantifiedInterpolants, 1093172 SizeOfPredicates, 6 NumberOfNonLiveVariables, 6649 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 1009/1036 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...