./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34ea1153081835871d2d8c4250456d7ca577de25 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:56:49,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:56:49,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:56:49,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:56:49,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:56:49,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:56:49,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:56:49,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:56:49,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:56:49,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:56:49,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:56:49,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:56:49,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:56:49,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:56:49,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:56:49,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:56:49,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:56:49,372 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:56:49,374 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:56:49,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:56:49,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:56:49,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:56:49,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:56:49,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:56:49,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:56:49,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:56:49,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:56:49,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:56:49,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:56:49,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:56:49,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:56:49,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:56:49,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:56:49,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:56:49,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:56:49,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:56:49,385 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:56:49,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:56:49,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:56:49,397 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:56:49,397 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:56:49,397 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:56:49,397 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:56:49,397 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:56:49,398 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:56:49,398 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:56:49,398 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:56:49,398 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:56:49,398 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:56:49,398 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:56:49,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:56:49,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:56:49,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:56:49,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:56:49,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:56:49,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:56:49,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:56:49,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:56:49,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:56:49,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:56:49,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:56:49,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:56:49,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:56:49,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:56:49,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:56:49,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:56:49,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:56:49,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:56:49,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:56:49,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:56:49,404 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:56:49,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:56:49,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:56:49,404 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:56:49,404 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan 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 -> Taipan 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 -> 34ea1153081835871d2d8c4250456d7ca577de25 [2018-11-18 17:56:49,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:56:49,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:56:49,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:56:49,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:56:49,441 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:56:49,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-11-18 17:56:49,480 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/data/7ab9a72e4/f8ff19bd127745b79288b92c52b88c38/FLAG08442ecbe [2018-11-18 17:56:49,860 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:56:49,860 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-11-18 17:56:49,873 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/data/7ab9a72e4/f8ff19bd127745b79288b92c52b88c38/FLAG08442ecbe [2018-11-18 17:56:49,883 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/data/7ab9a72e4/f8ff19bd127745b79288b92c52b88c38 [2018-11-18 17:56:49,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:56:49,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:56:49,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:56:49,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:56:49,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:56:49,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:56:49" (1/1) ... [2018-11-18 17:56:49,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae989df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:49, skipping insertion in model container [2018-11-18 17:56:49,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:56:49" (1/1) ... [2018-11-18 17:56:49,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:56:49,940 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:56:50,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:56:50,255 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:56:50,391 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:56:50,430 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:56:50,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50 WrapperNode [2018-11-18 17:56:50,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:56:50,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:56:50,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:56:50,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:56:50,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:56:50,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:56:50,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:56:50,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:56:50,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... [2018-11-18 17:56:50,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:56:50,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:56:50,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:56:50,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:56:50,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/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-18 17:56:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2018-11-18 17:56:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2018-11-18 17:56:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:56:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2018-11-18 17:56:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2018-11-18 17:56:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2018-11-18 17:56:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2018-11-18 17:56:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-18 17:56:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-18 17:56:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2018-11-18 17:56:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2018-11-18 17:56:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2018-11-18 17:56:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2018-11-18 17:56:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2018-11-18 17:56:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2018-11-18 17:56:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2018-11-18 17:56:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2018-11-18 17:56:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Base [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Base [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2018-11-18 17:56:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-18 17:56:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-18 17:56:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:56:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:56:51,108 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:56:51,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:56:51 BoogieIcfgContainer [2018-11-18 17:56:51,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:56:51,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:56:51,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:56:51,111 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:56:51,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:56:49" (1/3) ... [2018-11-18 17:56:51,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d10335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:56:51, skipping insertion in model container [2018-11-18 17:56:51,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:50" (2/3) ... [2018-11-18 17:56:51,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d10335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:56:51, skipping insertion in model container [2018-11-18 17:56:51,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:56:51" (3/3) ... [2018-11-18 17:56:51,113 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-11-18 17:56:51,119 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:56:51,125 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:56:51,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:56:51,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:56:51,157 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:56:51,157 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:56:51,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:56:51,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:56:51,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:56:51,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:56:51,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:56:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states. [2018-11-18 17:56:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 17:56:51,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:51,185 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:56:51,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:51,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1577048225, now seen corresponding path program 1 times [2018-11-18 17:56:51,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:51,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:51,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:56:51,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:51,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:56:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:56:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:56:51,486 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 2 states. [2018-11-18 17:56:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:51,516 INFO L93 Difference]: Finished difference Result 420 states and 526 transitions. [2018-11-18 17:56:51,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:56:51,517 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 141 [2018-11-18 17:56:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:51,525 INFO L225 Difference]: With dead ends: 420 [2018-11-18 17:56:51,525 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 17:56:51,531 INFO L604 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-18 17:56:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 17:56:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-18 17:56:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-18 17:56:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2018-11-18 17:56:51,576 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 141 [2018-11-18 17:56:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:51,577 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2018-11-18 17:56:51,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:56:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2018-11-18 17:56:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 17:56:51,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:51,580 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:56:51,580 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:51,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1315293037, now seen corresponding path program 1 times [2018-11-18 17:56:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:51,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:51,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:51,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:51,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:51,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:56:51,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:51,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:56:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:56:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:56:51,734 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand 3 states. [2018-11-18 17:56:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:51,764 INFO L93 Difference]: Finished difference Result 404 states and 495 transitions. [2018-11-18 17:56:51,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:56:51,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-18 17:56:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:51,767 INFO L225 Difference]: With dead ends: 404 [2018-11-18 17:56:51,767 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 17:56:51,769 INFO L604 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-18 17:56:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 17:56:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-11-18 17:56:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 17:56:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 313 transitions. [2018-11-18 17:56:51,786 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 313 transitions. Word has length 143 [2018-11-18 17:56:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:51,787 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 313 transitions. [2018-11-18 17:56:51,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:56:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 313 transitions. [2018-11-18 17:56:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-18 17:56:51,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:51,790 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:51,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:51,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1566464064, now seen corresponding path program 1 times [2018-11-18 17:56:51,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:51,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:51,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:56:51,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:56:51,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:51,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:56:51,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:56:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:56:51,969 INFO L87 Difference]: Start difference. First operand 251 states and 313 transitions. Second operand 6 states. [2018-11-18 17:56:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:52,336 INFO L93 Difference]: Finished difference Result 600 states and 750 transitions. [2018-11-18 17:56:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:56:52,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-18 17:56:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:52,341 INFO L225 Difference]: With dead ends: 600 [2018-11-18 17:56:52,341 INFO L226 Difference]: Without dead ends: 461 [2018-11-18 17:56:52,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:56:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-18 17:56:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 452. [2018-11-18 17:56:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-18 17:56:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 574 transitions. [2018-11-18 17:56:52,371 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 574 transitions. Word has length 149 [2018-11-18 17:56:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:52,371 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 574 transitions. [2018-11-18 17:56:52,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:56:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 574 transitions. [2018-11-18 17:56:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 17:56:52,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:52,374 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:52,377 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:52,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1521658979, now seen corresponding path program 1 times [2018-11-18 17:56:52,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:52,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:56:52,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:52,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 17:56:52,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:52,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:56:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:56:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:56:52,525 INFO L87 Difference]: Start difference. First operand 452 states and 574 transitions. Second operand 9 states. [2018-11-18 17:56:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:52,649 INFO L93 Difference]: Finished difference Result 761 states and 952 transitions. [2018-11-18 17:56:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:56:52,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2018-11-18 17:56:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:52,652 INFO L225 Difference]: With dead ends: 761 [2018-11-18 17:56:52,652 INFO L226 Difference]: Without dead ends: 482 [2018-11-18 17:56:52,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 17:56:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-11-18 17:56:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2018-11-18 17:56:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-18 17:56:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 600 transitions. [2018-11-18 17:56:52,678 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 600 transitions. Word has length 150 [2018-11-18 17:56:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:52,678 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 600 transitions. [2018-11-18 17:56:52,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:56:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 600 transitions. [2018-11-18 17:56:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 17:56:52,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:52,681 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:52,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:52,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1344783328, now seen corresponding path program 1 times [2018-11-18 17:56:52,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:52,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:52,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:56:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:52,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:56:52,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:52,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:56:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:56:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:56:52,806 INFO L87 Difference]: Start difference. First operand 472 states and 600 transitions. Second operand 6 states. [2018-11-18 17:56:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,056 INFO L93 Difference]: Finished difference Result 1214 states and 1534 transitions. [2018-11-18 17:56:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:56:53,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-18 17:56:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,061 INFO L225 Difference]: With dead ends: 1214 [2018-11-18 17:56:53,061 INFO L226 Difference]: Without dead ends: 915 [2018-11-18 17:56:53,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:56:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-11-18 17:56:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 894. [2018-11-18 17:56:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-18 17:56:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1150 transitions. [2018-11-18 17:56:53,102 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1150 transitions. Word has length 151 [2018-11-18 17:56:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,103 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1150 transitions. [2018-11-18 17:56:53,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:56:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1150 transitions. [2018-11-18 17:56:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 17:56:53,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,106 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:53,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2013724351, now seen corresponding path program 1 times [2018-11-18 17:56:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:56:53,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 17:56:53,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:56:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:56:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:56:53,224 INFO L87 Difference]: Start difference. First operand 894 states and 1150 transitions. Second operand 9 states. [2018-11-18 17:56:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,340 INFO L93 Difference]: Finished difference Result 1553 states and 1965 transitions. [2018-11-18 17:56:53,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:56:53,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-11-18 17:56:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,344 INFO L225 Difference]: With dead ends: 1553 [2018-11-18 17:56:53,344 INFO L226 Difference]: Without dead ends: 954 [2018-11-18 17:56:53,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 17:56:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-11-18 17:56:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 934. [2018-11-18 17:56:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-11-18 17:56:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1202 transitions. [2018-11-18 17:56:53,374 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1202 transitions. Word has length 152 [2018-11-18 17:56:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,375 INFO L480 AbstractCegarLoop]: Abstraction has 934 states and 1202 transitions. [2018-11-18 17:56:53,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:56:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1202 transitions. [2018-11-18 17:56:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-18 17:56:53,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,377 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:53,378 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash -604824832, now seen corresponding path program 1 times [2018-11-18 17:56:53,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:56:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:56:53,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:56:53,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:56:53,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:56:53,477 INFO L87 Difference]: Start difference. First operand 934 states and 1202 transitions. Second operand 6 states. [2018-11-18 17:56:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,670 INFO L93 Difference]: Finished difference Result 2450 states and 3123 transitions. [2018-11-18 17:56:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:56:53,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-11-18 17:56:53,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,675 INFO L225 Difference]: With dead ends: 2450 [2018-11-18 17:56:53,675 INFO L226 Difference]: Without dead ends: 1670 [2018-11-18 17:56:53,677 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:56:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2018-11-18 17:56:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1636. [2018-11-18 17:56:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-11-18 17:56:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2138 transitions. [2018-11-18 17:56:53,725 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2138 transitions. Word has length 153 [2018-11-18 17:56:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,725 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2138 transitions. [2018-11-18 17:56:53,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:56:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2138 transitions. [2018-11-18 17:56:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 17:56:53,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,728 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:53,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1285506532, now seen corresponding path program 1 times [2018-11-18 17:56:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:53,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:56:53,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:56:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:56:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:56:53,780 INFO L87 Difference]: Start difference. First operand 1636 states and 2138 transitions. Second operand 3 states. [2018-11-18 17:56:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,820 INFO L93 Difference]: Finished difference Result 3463 states and 4663 transitions. [2018-11-18 17:56:53,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:56:53,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2018-11-18 17:56:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,825 INFO L225 Difference]: With dead ends: 3463 [2018-11-18 17:56:53,825 INFO L226 Difference]: Without dead ends: 1875 [2018-11-18 17:56:53,828 INFO L604 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-18 17:56:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2018-11-18 17:56:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1868. [2018-11-18 17:56:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1868 states. [2018-11-18 17:56:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2563 transitions. [2018-11-18 17:56:53,872 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2563 transitions. Word has length 163 [2018-11-18 17:56:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,873 INFO L480 AbstractCegarLoop]: Abstraction has 1868 states and 2563 transitions. [2018-11-18 17:56:53,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:56:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2563 transitions. [2018-11-18 17:56:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 17:56:53,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,876 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:53,876 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -602742857, now seen corresponding path program 1 times [2018-11-18 17:56:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:53,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:56:53,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:56:53,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:56:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:56:53,925 INFO L87 Difference]: Start difference. First operand 1868 states and 2563 transitions. Second operand 3 states. [2018-11-18 17:56:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,977 INFO L93 Difference]: Finished difference Result 4119 states and 5874 transitions. [2018-11-18 17:56:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:56:53,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-11-18 17:56:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,983 INFO L225 Difference]: With dead ends: 4119 [2018-11-18 17:56:53,983 INFO L226 Difference]: Without dead ends: 2299 [2018-11-18 17:56:53,986 INFO L604 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-18 17:56:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2018-11-18 17:56:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2292. [2018-11-18 17:56:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2018-11-18 17:56:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3341 transitions. [2018-11-18 17:56:54,043 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3341 transitions. Word has length 164 [2018-11-18 17:56:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:54,044 INFO L480 AbstractCegarLoop]: Abstraction has 2292 states and 3341 transitions. [2018-11-18 17:56:54,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:56:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3341 transitions. [2018-11-18 17:56:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 17:56:54,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:54,047 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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-18 17:56:54,047 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:54,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:54,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1123513254, now seen corresponding path program 1 times [2018-11-18 17:56:54,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:54,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:54,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:54,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:56:54,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:54,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:56:54,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:56:54,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:56:54,100 INFO L87 Difference]: Start difference. First operand 2292 states and 3341 transitions. Second operand 3 states. [2018-11-18 17:56:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:54,173 INFO L93 Difference]: Finished difference Result 5407 states and 8224 transitions. [2018-11-18 17:56:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:56:54,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2018-11-18 17:56:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:54,182 INFO L225 Difference]: With dead ends: 5407 [2018-11-18 17:56:54,182 INFO L226 Difference]: Without dead ends: 3163 [2018-11-18 17:56:54,186 INFO L604 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-18 17:56:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2018-11-18 17:56:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3156. [2018-11-18 17:56:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3156 states. [2018-11-18 17:56:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 4897 transitions. [2018-11-18 17:56:54,279 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 4897 transitions. Word has length 165 [2018-11-18 17:56:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:54,279 INFO L480 AbstractCegarLoop]: Abstraction has 3156 states and 4897 transitions. [2018-11-18 17:56:54,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:56:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 4897 transitions. [2018-11-18 17:56:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-18 17:56:54,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:54,285 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:54,285 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 865254391, now seen corresponding path program 1 times [2018-11-18 17:56:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:54,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:54,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:54,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:54,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:54,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:56:54,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:54,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:56:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:56:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:56:54,378 INFO L87 Difference]: Start difference. First operand 3156 states and 4897 transitions. Second operand 3 states. [2018-11-18 17:56:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:54,478 INFO L93 Difference]: Finished difference Result 7967 states and 12828 transitions. [2018-11-18 17:56:54,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:56:54,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-11-18 17:56:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:54,490 INFO L225 Difference]: With dead ends: 7967 [2018-11-18 17:56:54,490 INFO L226 Difference]: Without dead ends: 4859 [2018-11-18 17:56:54,495 INFO L604 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-18 17:56:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2018-11-18 17:56:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4852. [2018-11-18 17:56:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2018-11-18 17:56:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7913 transitions. [2018-11-18 17:56:54,616 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7913 transitions. Word has length 166 [2018-11-18 17:56:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:54,616 INFO L480 AbstractCegarLoop]: Abstraction has 4852 states and 7913 transitions. [2018-11-18 17:56:54,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:56:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7913 transitions. [2018-11-18 17:56:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 17:56:54,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:54,624 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:54,624 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:54,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 542040488, now seen corresponding path program 1 times [2018-11-18 17:56:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:54,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:54,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:56:54,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:54,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:56:54,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:54,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:56:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:56:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:56:54,676 INFO L87 Difference]: Start difference. First operand 4852 states and 7913 transitions. Second operand 3 states. [2018-11-18 17:56:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:54,851 INFO L93 Difference]: Finished difference Result 12991 states and 21748 transitions. [2018-11-18 17:56:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:56:54,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-11-18 17:56:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:54,872 INFO L225 Difference]: With dead ends: 12991 [2018-11-18 17:56:54,872 INFO L226 Difference]: Without dead ends: 8187 [2018-11-18 17:56:54,881 INFO L604 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-18 17:56:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2018-11-18 17:56:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8180. [2018-11-18 17:56:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-11-18 17:56:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 13753 transitions. [2018-11-18 17:56:55,141 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 13753 transitions. Word has length 167 [2018-11-18 17:56:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:55,141 INFO L480 AbstractCegarLoop]: Abstraction has 8180 states and 13753 transitions. [2018-11-18 17:56:55,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:56:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 13753 transitions. [2018-11-18 17:56:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 17:56:55,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:55,159 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-18 17:56:55,159 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:55,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1438386677, now seen corresponding path program 1 times [2018-11-18 17:56:55,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:55,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:55,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:56:55,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:55,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 17:56:55,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:55,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:56:55,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:56:55,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:56:55,282 INFO L87 Difference]: Start difference. First operand 8180 states and 13753 transitions. Second operand 8 states. [2018-11-18 17:56:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:55,473 INFO L93 Difference]: Finished difference Result 8180 states and 13753 transitions. [2018-11-18 17:56:55,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:56:55,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 168 [2018-11-18 17:56:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:55,474 INFO L225 Difference]: With dead ends: 8180 [2018-11-18 17:56:55,475 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:56:55,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:56:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:56:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:56:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:56:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:56:55,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2018-11-18 17:56:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:55,488 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:56:55,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:56:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:56:55,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:56:55,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:56:56,470 INFO L425 ceAbstractionStarter]: For program point L2528(lines 2528 2536) no Hoare annotation was computed. [2018-11-18 17:56:56,471 INFO L425 ceAbstractionStarter]: For program point L2531-2(lines 2521 2540) no Hoare annotation was computed. [2018-11-18 17:56:56,471 INFO L421 ceAbstractionStarter]: At program point setClientForwardReceiverENTRY(lines 2521 2540) the Hoare annotation is: (and (or (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (= 0 ~__ste_client_forwardReceiver2~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= 0 ~__ste_client_forwardReceiver0~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (= 0 ~__ste_client_forwardReceiver1~0))) [2018-11-18 17:56:56,471 INFO L425 ceAbstractionStarter]: For program point L2525(lines 2525 2537) no Hoare annotation was computed. [2018-11-18 17:56:56,471 INFO L425 ceAbstractionStarter]: For program point setClientForwardReceiverEXIT(lines 2521 2540) no Hoare annotation was computed. [2018-11-18 17:56:56,471 INFO L425 ceAbstractionStarter]: For program point L2531(lines 2531 2535) no Hoare annotation was computed. [2018-11-18 17:56:56,471 INFO L428 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: true [2018-11-18 17:56:56,471 INFO L428 ceAbstractionStarter]: At program point L544(line 544) the Hoare annotation is: true [2018-11-18 17:56:56,472 INFO L428 ceAbstractionStarter]: At program point L545-1(line 545) the Hoare annotation is: true [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point L544-1(line 544) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point outgoingEXIT(lines 539 550) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L428 ceAbstractionStarter]: At program point outgoingENTRY(lines 539 550) the Hoare annotation is: true [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point outgoingFINAL(lines 539 550) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 89 95) the Hoare annotation is: true [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 89 95) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point getClientIdFINAL(lines 2544 2567) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point L2556(lines 2556 2562) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L428 ceAbstractionStarter]: At program point getClientIdENTRY(lines 2544 2567) the Hoare annotation is: true [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point L2552(lines 2552 2563) no Hoare annotation was computed. [2018-11-18 17:56:56,472 INFO L425 ceAbstractionStarter]: For program point L2548(lines 2548 2564) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point getClientIdEXIT(lines 2544 2567) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L428 ceAbstractionStarter]: At program point mailENTRY(lines 527 538) the Hoare annotation is: true [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point mailEXIT(lines 527 538) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point mailFINAL(lines 527 538) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L428 ceAbstractionStarter]: At program point L534(line 534) the Hoare annotation is: true [2018-11-18 17:56:56,473 INFO L428 ceAbstractionStarter]: At program point L533(line 533) the Hoare annotation is: true [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point L533-1(line 533) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 96 104) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 96 104) the Hoare annotation is: true [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 96 104) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point get_queued_clientEXIT(lines 657 665) no Hoare annotation was computed. [2018-11-18 17:56:56,473 INFO L428 ceAbstractionStarter]: At program point get_queued_clientENTRY(lines 657 665) the Hoare annotation is: true [2018-11-18 17:56:56,473 INFO L425 ceAbstractionStarter]: For program point get_queued_clientFINAL(lines 657 665) no Hoare annotation was computed. [2018-11-18 17:56:56,474 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-18 17:56:56,474 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (= |incoming__wrappee__AutoResponder_#in~client| incoming__wrappee__AutoResponder_~client) [2018-11-18 17:56:56,474 INFO L421 ceAbstractionStarter]: At program point L576-1(line 576) the Hoare annotation is: (= |incoming__wrappee__AutoResponder_#in~client| incoming__wrappee__AutoResponder_~client) [2018-11-18 17:56:56,474 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__AutoResponderENTRY(lines 571 588) the Hoare annotation is: true [2018-11-18 17:56:56,474 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__AutoResponderEXIT(lines 571 588) no Hoare annotation was computed. [2018-11-18 17:56:56,474 INFO L421 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: (= |incoming__wrappee__AutoResponder_#in~client| incoming__wrappee__AutoResponder_~client) [2018-11-18 17:56:56,474 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2018-11-18 17:56:56,474 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 571 588) no Hoare annotation was computed. [2018-11-18 17:56:56,474 INFO L425 ceAbstractionStarter]: For program point deliverFINAL(lines 551 560) no Hoare annotation was computed. [2018-11-18 17:56:56,474 INFO L428 ceAbstractionStarter]: At program point deliverENTRY(lines 551 560) the Hoare annotation is: true [2018-11-18 17:56:56,474 INFO L425 ceAbstractionStarter]: For program point deliverEXIT(lines 551 560) no Hoare annotation was computed. [2018-11-18 17:56:56,475 INFO L425 ceAbstractionStarter]: For program point getEmailIdFINAL(lines 885 903) no Hoare annotation was computed. [2018-11-18 17:56:56,475 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 899) no Hoare annotation was computed. [2018-11-18 17:56:56,475 INFO L425 ceAbstractionStarter]: For program point getEmailIdEXIT(lines 885 903) no Hoare annotation was computed. [2018-11-18 17:56:56,475 INFO L425 ceAbstractionStarter]: For program point L889(lines 889 900) no Hoare annotation was computed. [2018-11-18 17:56:56,475 INFO L428 ceAbstractionStarter]: At program point getEmailIdENTRY(lines 885 903) the Hoare annotation is: true [2018-11-18 17:56:56,475 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 808 828) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,475 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 808 828) no Hoare annotation was computed. [2018-11-18 17:56:56,475 INFO L421 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0) (= main_~tmp~12 1)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,475 INFO L421 ceAbstractionStarter]: At program point L820-1(line 820) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0) (= main_~tmp~12 1)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,475 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 825) no Hoare annotation was computed. [2018-11-18 17:56:56,476 INFO L425 ceAbstractionStarter]: For program point L818-1(lines 818 825) no Hoare annotation was computed. [2018-11-18 17:56:56,476 INFO L425 ceAbstractionStarter]: For program point L816(line 816) no Hoare annotation was computed. [2018-11-18 17:56:56,476 INFO L421 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,476 INFO L421 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,476 INFO L421 ceAbstractionStarter]: At program point L814-1(line 814) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,476 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 808 828) no Hoare annotation was computed. [2018-11-18 17:56:56,476 INFO L425 ceAbstractionStarter]: For program point setup_chuckEXIT(lines 741 750) no Hoare annotation was computed. [2018-11-18 17:56:56,476 INFO L428 ceAbstractionStarter]: At program point setup_chuckENTRY(lines 741 750) the Hoare annotation is: true [2018-11-18 17:56:56,476 INFO L428 ceAbstractionStarter]: At program point L746(line 746) the Hoare annotation is: true [2018-11-18 17:56:56,476 INFO L425 ceAbstractionStarter]: For program point setup_chuckFINAL(lines 741 750) no Hoare annotation was computed. [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point L736(line 736) the Hoare annotation is: true [2018-11-18 17:56:56,477 INFO L425 ceAbstractionStarter]: For program point setup_rjhFINAL(lines 731 740) no Hoare annotation was computed. [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point setup_rjhENTRY(lines 731 740) the Hoare annotation is: true [2018-11-18 17:56:56,477 INFO L425 ceAbstractionStarter]: For program point setup_rjhEXIT(lines 731 740) no Hoare annotation was computed. [2018-11-18 17:56:56,477 INFO L425 ceAbstractionStarter]: For program point sendEmailEXIT(lines 625 637) no Hoare annotation was computed. [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point sendEmailENTRY(lines 625 637) the Hoare annotation is: true [2018-11-18 17:56:56,477 INFO L425 ceAbstractionStarter]: For program point sendEmailFINAL(lines 625 637) no Hoare annotation was computed. [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point L633(line 633) the Hoare annotation is: true [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point L631(line 631) the Hoare annotation is: true [2018-11-18 17:56:56,477 INFO L425 ceAbstractionStarter]: For program point L631-1(line 631) no Hoare annotation was computed. [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: true [2018-11-18 17:56:56,477 INFO L428 ceAbstractionStarter]: At program point L767(line 767) the Hoare annotation is: true [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point L768-1(lines 751 773) no Hoare annotation was computed. [2018-11-18 17:56:56,478 INFO L428 ceAbstractionStarter]: At program point L766(line 766) the Hoare annotation is: true [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point L767-1(line 767) no Hoare annotation was computed. [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point L766-1(line 766) no Hoare annotation was computed. [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point L760(line 760) no Hoare annotation was computed. [2018-11-18 17:56:56,478 INFO L428 ceAbstractionStarter]: At program point L759(line 759) the Hoare annotation is: true [2018-11-18 17:56:56,478 INFO L428 ceAbstractionStarter]: At program point L759-1(line 759) the Hoare annotation is: true [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point bobToRjhEXIT(lines 751 773) no Hoare annotation was computed. [2018-11-18 17:56:56,478 INFO L428 ceAbstractionStarter]: At program point bobToRjhENTRY(lines 751 773) the Hoare annotation is: true [2018-11-18 17:56:56,478 INFO L428 ceAbstractionStarter]: At program point setup_bobENTRY(lines 721 730) the Hoare annotation is: true [2018-11-18 17:56:56,478 INFO L425 ceAbstractionStarter]: For program point setup_bobFINAL(lines 721 730) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L428 ceAbstractionStarter]: At program point L726(line 726) the Hoare annotation is: true [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point setup_bobEXIT(lines 721 730) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point getClientAutoResponseFINAL(lines 2062 2085) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point getClientAutoResponseEXIT(lines 2062 2085) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point L2074(lines 2074 2080) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L428 ceAbstractionStarter]: At program point getClientAutoResponseENTRY(lines 2062 2085) the Hoare annotation is: true [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point L2070(lines 2070 2081) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point L2066(lines 2066 2082) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 82 88) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 82 88) the Hoare annotation is: true [2018-11-18 17:56:56,479 INFO L425 ceAbstractionStarter]: For program point autoRespondEXIT(lines 675 689) no Hoare annotation was computed. [2018-11-18 17:56:56,479 INFO L428 ceAbstractionStarter]: At program point L684(line 684) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L428 ceAbstractionStarter]: At program point autoRespondENTRY(lines 675 689) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L428 ceAbstractionStarter]: At program point L684-1(line 684) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L425 ceAbstractionStarter]: For program point autoRespondFINAL(lines 675 689) no Hoare annotation was computed. [2018-11-18 17:56:56,480 INFO L428 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L425 ceAbstractionStarter]: For program point L682-1(line 682) no Hoare annotation was computed. [2018-11-18 17:56:56,480 INFO L428 ceAbstractionStarter]: At program point rjhSetAutoRespondENTRY(lines 829 838) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L425 ceAbstractionStarter]: For program point rjhSetAutoRespondFINAL(lines 829 838) no Hoare annotation was computed. [2018-11-18 17:56:56,480 INFO L425 ceAbstractionStarter]: For program point rjhSetAutoRespondEXIT(lines 829 838) no Hoare annotation was computed. [2018-11-18 17:56:56,480 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__BaseENTRY(lines 561 570) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-18 17:56:56,480 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__BaseFINAL(lines 561 570) no Hoare annotation was computed. [2018-11-18 17:56:56,480 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__BaseEXIT(lines 561 570) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverFINAL(lines 2497 2520) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point L2509(lines 2509 2515) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverEXIT(lines 2497 2520) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point L2505(lines 2505 2516) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L428 ceAbstractionStarter]: At program point getClientForwardReceiverENTRY(lines 2497 2520) the Hoare annotation is: true [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point L2501(lines 2501 2517) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L428 ceAbstractionStarter]: At program point incomingENTRY(lines 589 609) the Hoare annotation is: true [2018-11-18 17:56:56,481 INFO L421 ceAbstractionStarter]: At program point L601(line 601) the Hoare annotation is: (or (not (= 0 ~__ste_client_forwardReceiver1~0)) (not (= 0 ~__ste_client_forwardReceiver2~0)) (not (= 0 ~__ste_client_forwardReceiver0~0))) [2018-11-18 17:56:56,481 INFO L421 ceAbstractionStarter]: At program point L601-1(line 601) the Hoare annotation is: (or (not (= 0 ~__ste_client_forwardReceiver1~0)) (not (= 0 ~__ste_client_forwardReceiver2~0)) (not (= 0 ~__ste_client_forwardReceiver0~0))) [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 606) no Hoare annotation was computed. [2018-11-18 17:56:56,481 INFO L425 ceAbstractionStarter]: For program point L599-1(lines 589 609) no Hoare annotation was computed. [2018-11-18 17:56:56,482 INFO L425 ceAbstractionStarter]: For program point L596(line 596) no Hoare annotation was computed. [2018-11-18 17:56:56,482 INFO L428 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: true [2018-11-18 17:56:56,482 INFO L425 ceAbstractionStarter]: For program point incomingEXIT(lines 589 609) no Hoare annotation was computed. [2018-11-18 17:56:56,482 INFO L428 ceAbstractionStarter]: At program point L595-1(line 595) the Hoare annotation is: true [2018-11-18 17:56:56,482 INFO L425 ceAbstractionStarter]: For program point createEmailEXIT(lines 1500 1514) no Hoare annotation was computed. [2018-11-18 17:56:56,482 INFO L425 ceAbstractionStarter]: For program point L1508(line 1508) no Hoare annotation was computed. [2018-11-18 17:56:56,482 INFO L428 ceAbstractionStarter]: At program point createEmailENTRY(lines 1500 1514) the Hoare annotation is: true [2018-11-18 17:56:56,482 INFO L428 ceAbstractionStarter]: At program point L1507(line 1507) the Hoare annotation is: true [2018-11-18 17:56:56,482 INFO L428 ceAbstractionStarter]: At program point L1507-1(line 1507) the Hoare annotation is: true [2018-11-18 17:56:56,482 INFO L425 ceAbstractionStarter]: For program point createEmailFINAL(lines 1500 1514) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L428 ceAbstractionStarter]: At program point L1340(lines 1330 1440) the Hoare annotation is: true [2018-11-18 17:56:56,483 INFO L428 ceAbstractionStarter]: At program point L1398(lines 1388 1435) the Hoare annotation is: true [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 1258 1451) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 1258 1451) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point L1367(lines 1367 1374) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 1258 1451) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point L1334(lines 1334 1338) no Hoare annotation was computed. [2018-11-18 17:56:56,483 INFO L425 ceAbstractionStarter]: For program point L1425(lines 1425 1429) no Hoare annotation was computed. [2018-11-18 17:56:56,484 INFO L425 ceAbstractionStarter]: For program point L1392(lines 1392 1396) no Hoare annotation was computed. [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1425-1(lines 1297 1443) the Hoare annotation is: true [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1351(lines 1341 1439) the Hoare annotation is: true [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1409(lines 1399 1434) the Hoare annotation is: true [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1376(lines 1363 1437) the Hoare annotation is: true [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1369(line 1369) the Hoare annotation is: true [2018-11-18 17:56:56,484 INFO L425 ceAbstractionStarter]: For program point L1369-1(line 1369) no Hoare annotation was computed. [2018-11-18 17:56:56,484 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1327) no Hoare annotation was computed. [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1444(lines 1296 1445) the Hoare annotation is: true [2018-11-18 17:56:56,484 INFO L425 ceAbstractionStarter]: For program point L1345(lines 1345 1349) no Hoare annotation was computed. [2018-11-18 17:56:56,484 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1407) no Hoare annotation was computed. [2018-11-18 17:56:56,484 INFO L428 ceAbstractionStarter]: At program point L1362(lines 1352 1438) the Hoare annotation is: true [2018-11-18 17:56:56,485 INFO L428 ceAbstractionStarter]: At program point L1329(lines 1316 1441) the Hoare annotation is: true [2018-11-18 17:56:56,485 INFO L428 ceAbstractionStarter]: At program point L1420(lines 1410 1433) the Hoare annotation is: true [2018-11-18 17:56:56,485 INFO L428 ceAbstractionStarter]: At program point L1387(lines 1377 1436) the Hoare annotation is: true [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1305(lines 1305 1442) no Hoare annotation was computed. [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1297-1(lines 1297 1443) no Hoare annotation was computed. [2018-11-18 17:56:56,485 INFO L421 ceAbstractionStarter]: At program point L1322(line 1322) the Hoare annotation is: (or (= test_~op2~0 0) (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1322-1(line 1322) no Hoare annotation was computed. [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1298(lines 1297 1443) no Hoare annotation was computed. [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1360) no Hoare annotation was computed. [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1414(lines 1414 1418) no Hoare annotation was computed. [2018-11-18 17:56:56,485 INFO L425 ceAbstractionStarter]: For program point L1381(lines 1381 1385) no Hoare annotation was computed. [2018-11-18 17:56:56,486 INFO L428 ceAbstractionStarter]: At program point L1315(lines 1305 1442) the Hoare annotation is: true [2018-11-18 17:56:56,486 INFO L428 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: true [2018-11-18 17:56:56,486 INFO L425 ceAbstractionStarter]: For program point L1472-1(line 1472) no Hoare annotation was computed. [2018-11-18 17:56:56,486 INFO L428 ceAbstractionStarter]: At program point L1469(line 1469) the Hoare annotation is: true [2018-11-18 17:56:56,486 INFO L425 ceAbstractionStarter]: For program point L1469-1(line 1469) no Hoare annotation was computed. [2018-11-18 17:56:56,486 INFO L428 ceAbstractionStarter]: At program point L1466(line 1466) the Hoare annotation is: true [2018-11-18 17:56:56,486 INFO L425 ceAbstractionStarter]: For program point L1466-1(line 1466) no Hoare annotation was computed. [2018-11-18 17:56:56,486 INFO L425 ceAbstractionStarter]: For program point printMailEXIT(lines 1454 1481) no Hoare annotation was computed. [2018-11-18 17:56:56,486 INFO L428 ceAbstractionStarter]: At program point printMailENTRY(lines 1454 1481) the Hoare annotation is: true [2018-11-18 17:56:56,486 INFO L428 ceAbstractionStarter]: At program point L1475(line 1475) the Hoare annotation is: true [2018-11-18 17:56:56,486 INFO L425 ceAbstractionStarter]: For program point printMailFINAL(lines 1454 1481) no Hoare annotation was computed. [2018-11-18 17:56:56,486 INFO L425 ceAbstractionStarter]: For program point L1475-1(line 1475) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L428 ceAbstractionStarter]: At program point forwardENTRY(lines 690 703) the Hoare annotation is: true [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point forwardEXIT(lines 690 703) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L428 ceAbstractionStarter]: At program point L698(line 698) the Hoare annotation is: true [2018-11-18 17:56:56,487 INFO L428 ceAbstractionStarter]: At program point L698-1(line 698) the Hoare annotation is: true [2018-11-18 17:56:56,487 INFO L428 ceAbstractionStarter]: At program point L696(line 696) the Hoare annotation is: true [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point forwardFINAL(lines 690 703) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point L696-1(line 696) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 989) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point L985-2(lines 978 993) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point L982(lines 982 990) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L425 ceAbstractionStarter]: For program point setEmailToEXIT(lines 978 993) no Hoare annotation was computed. [2018-11-18 17:56:56,487 INFO L428 ceAbstractionStarter]: At program point setEmailToENTRY(lines 978 993) the Hoare annotation is: true [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point getEmailToFINAL(lines 959 977) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point getEmailToEXIT(lines 959 977) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point L967(lines 967 973) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L428 ceAbstractionStarter]: At program point getEmailToENTRY(lines 959 977) the Hoare annotation is: true [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 974) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyEXIT(lines 648 656) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L428 ceAbstractionStarter]: At program point is_queue_emptyENTRY(lines 648 656) the Hoare annotation is: true [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyFINAL(lines 648 656) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L428 ceAbstractionStarter]: At program point get_queued_emailENTRY(lines 666 674) the Hoare annotation is: true [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point get_queued_emailFINAL(lines 666 674) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point get_queued_emailEXIT(lines 666 674) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point setClientAutoResponseEXIT(lines 2086 2105) no Hoare annotation was computed. [2018-11-18 17:56:56,488 INFO L425 ceAbstractionStarter]: For program point L2096(lines 2096 2100) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point L2096-2(lines 2086 2105) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point L2093(lines 2093 2101) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L428 ceAbstractionStarter]: At program point setClientAutoResponseENTRY(lines 2086 2105) the Hoare annotation is: true [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point L2090(lines 2090 2102) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingEXIT(lines 839 848) no Hoare annotation was computed. [2018-11-18 17:56:56,489 INFO L421 ceAbstractionStarter]: At program point rjhEnableForwardingENTRY(lines 839 848) the Hoare annotation is: (and (or (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (= 0 ~__ste_client_forwardReceiver2~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= 0 ~__ste_client_forwardReceiver0~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (= 0 ~__ste_client_forwardReceiver1~0))) [2018-11-18 17:56:56,489 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingFINAL(lines 839 848) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point L945(lines 945 953) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L428 ceAbstractionStarter]: At program point setEmailFromENTRY(lines 941 956) the Hoare annotation is: true [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point setEmailFromEXIT(lines 941 956) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 952) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point L948-2(lines 941 956) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L428 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: true [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point L801-1(line 801) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 785 807) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L428 ceAbstractionStarter]: At program point setupENTRY(lines 785 807) the Hoare annotation is: true [2018-11-18 17:56:56,490 INFO L428 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: true [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-18 17:56:56,490 INFO L425 ceAbstractionStarter]: For program point setupFINAL(lines 785 807) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L428 ceAbstractionStarter]: At program point L793(line 793) the Hoare annotation is: true [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point L793-1(line 793) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) [2018-11-18 17:56:56,491 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point getEmailFromFINAL(lines 922 940) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point L926(lines 926 937) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point getEmailFromEXIT(lines 922 940) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L428 ceAbstractionStarter]: At program point getEmailFromENTRY(lines 922 940) the Hoare annotation is: true [2018-11-18 17:56:56,491 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-18 17:56:56,491 INFO L421 ceAbstractionStarter]: At program point L129(line 129) the Hoare annotation is: false [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 117 134) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point __utac_acc__DecryptForward_spec__1EXIT(lines 117 134) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 131) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L428 ceAbstractionStarter]: At program point L123(line 123) the Hoare annotation is: true [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point L123-1(line 123) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L428 ceAbstractionStarter]: At program point __utac_acc__DecryptForward_spec__1ENTRY(lines 117 134) the Hoare annotation is: true [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point isReadableEXIT(lines 1482 1490) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L428 ceAbstractionStarter]: At program point isReadableENTRY(lines 1482 1490) the Hoare annotation is: true [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point isReadableFINAL(lines 1482 1490) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 106 113) no Hoare annotation was computed. [2018-11-18 17:56:56,492 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 106 113) the Hoare annotation is: true [2018-11-18 17:56:56,492 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 106 113) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point queueFINAL(lines 638 647) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L428 ceAbstractionStarter]: At program point queueENTRY(lines 638 647) the Hoare annotation is: true [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point queueEXIT(lines 638 647) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point L2578(lines 2578 2582) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point L2578-2(lines 2568 2587) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point L2575(lines 2575 2583) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point L2572(lines 2572 2584) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L425 ceAbstractionStarter]: For program point setClientIdEXIT(lines 2568 2587) no Hoare annotation was computed. [2018-11-18 17:56:56,493 INFO L428 ceAbstractionStarter]: At program point setClientIdENTRY(lines 2568 2587) the Hoare annotation is: true [2018-11-18 17:56:56,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:56:56 BoogieIcfgContainer [2018-11-18 17:56:56,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:56:56,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:56:56,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:56:56,504 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:56:56,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:56:51" (3/4) ... [2018-11-18 17:56:56,507 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:56:56,514 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientForwardReceiver [2018-11-18 17:56:56,514 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing [2018-11-18 17:56:56,514 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientId [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mail [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_client [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__AutoResponder [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deliver [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailId [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh [2018-11-18 17:56:56,515 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sendEmail [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobToRjh [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientAutoResponse [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure autoRespond [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhSetAutoRespond [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__Base [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientForwardReceiver [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure createEmail [2018-11-18 17:56:56,516 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure printMail [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure forward [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_queue_empty [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_email [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientAutoResponse [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhEnableForwarding [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2018-11-18 17:56:56,517 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-18 17:56:56,518 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2018-11-18 17:56:56,518 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__DecryptForward_spec__1 [2018-11-18 17:56:56,518 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isReadable [2018-11-18 17:56:56,518 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-18 17:56:56,518 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure queue [2018-11-18 17:56:56,518 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientId [2018-11-18 17:56:56,528 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2018-11-18 17:56:56,528 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-18 17:56:56,529 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 17:56:56,530 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:56:56,620 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ee9d6843-a6a8-4d6c-9e20-f44f4887b190/bin-2019/utaipan/witness.graphml [2018-11-18 17:56:56,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:56:56,621 INFO L168 Benchmark]: Toolchain (without parser) took 6735.32 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.9 MB). Free memory was 956.4 MB in the beginning and 829.6 MB in the end (delta: 126.8 MB). Peak memory consumption was 610.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:56,621 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:56:56,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:56,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:56:56,622 INFO L168 Benchmark]: Boogie Preprocessor took 40.16 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:56,622 INFO L168 Benchmark]: RCFGBuilder took 610.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:56,623 INFO L168 Benchmark]: TraceAbstraction took 5394.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.8 MB). Free memory was 1.0 GB in the beginning and 841.1 MB in the end (delta: 208.7 MB). Peak memory consumption was 517.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:56,623 INFO L168 Benchmark]: Witness Printer took 116.37 ms. Allocated memory is still 1.5 GB. Free memory was 841.1 MB in the beginning and 829.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:56,624 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.16 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 610.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5394.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 308.8 MB). Free memory was 1.0 GB in the beginning and 841.1 MB in the end (delta: 208.7 MB). Peak memory consumption was 517.5 MB. Max. memory is 11.5 GB. * Witness Printer took 116.37 ms. Allocated memory is still 1.5 GB. Free memory was 841.1 MB in the beginning and 829.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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: 1296]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1352]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1410]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1363]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1297]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1377]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 43 procedures, 259 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4147 SDtfs, 1085 SDslu, 11417 SDs, 0 SdLazy, 674 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8180occurred in iteration=12, 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: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 130 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 103 LocationsWithAnnotation, 5282 PreInvPairs, 8582 NumberOfFragments, 365 HoareAnnotationTreeSize, 5282 FomulaSimplifications, 2212 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 103 FomulaSimplificationsInter, 5977 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2032 NumberOfCodeBlocks, 2032 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2019 ConstructedInterpolants, 0 QuantifiedInterpolants, 382815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 293/293 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...