./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/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 287a23d08eab86c6fb35463a3e779b64ab9bd712 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:20,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:20,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:20,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:20,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:20,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:20,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:20,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:20,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:20,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:20,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:20,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:20,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:20,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:20,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:20,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:20,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:20,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:20,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:20,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:20,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:20,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:20,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:20,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:20,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:20,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:20,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:20,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:20,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:20,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:20,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:20,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:20,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:20,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:20,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:20,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:20,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:20,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:20,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:20,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:20,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:20,880 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:20,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:20,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:20,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:20,895 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:20,895 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:20,895 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:20,895 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:20,895 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:20,896 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:20,896 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:20,896 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:20,897 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:20,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:20,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:20,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:20,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:20,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:20,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:20,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:20,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:20,899 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:20,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:20,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:20,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:20,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:20,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:20,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:20,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:20,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:20,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:20,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:20,902 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:20,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:20,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:20,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:20,903 INFO L138 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_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/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 -> 287a23d08eab86c6fb35463a3e779b64ab9bd712 [2019-10-22 11:23:20,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:20,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:20,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:20,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:20,972 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:20,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/../../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2019-10-22 11:23:21,029 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/data/de6a4884b/bdfe4cb1b739462d919800a7c63f48df/FLAGe6c9c4383 [2019-10-22 11:23:21,495 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:21,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2019-10-22 11:23:21,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/data/de6a4884b/bdfe4cb1b739462d919800a7c63f48df/FLAGe6c9c4383 [2019-10-22 11:23:21,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/data/de6a4884b/bdfe4cb1b739462d919800a7c63f48df [2019-10-22 11:23:22,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:22,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:22,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:22,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:22,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:22,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:21" (1/1) ... [2019-10-22 11:23:22,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dde477f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22, skipping insertion in model container [2019-10-22 11:23:22,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:21" (1/1) ... [2019-10-22 11:23:22,019 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:22,106 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:22,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:22,723 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:22,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:22,925 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:22,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22 WrapperNode [2019-10-22 11:23:22,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:22,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:22,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:22,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:22,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:22,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:23,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:23,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:23,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:23,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... [2019-10-22 11:23:23,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:23,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:23,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:23,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:23,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/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 [2019-10-22 11:23:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-22 11:23:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:23,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:23,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:23,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:24,267 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:24,267 INFO L284 CfgBuilder]: Removed 127 assume(true) statements. [2019-10-22 11:23:24,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:24 BoogieIcfgContainer [2019-10-22 11:23:24,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:24,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:24,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:24,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:24,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:21" (1/3) ... [2019-10-22 11:23:24,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5914e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:24, skipping insertion in model container [2019-10-22 11:23:24,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:22" (2/3) ... [2019-10-22 11:23:24,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5914e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:24, skipping insertion in model container [2019-10-22 11:23:24,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:24" (3/3) ... [2019-10-22 11:23:24,279 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2019-10-22 11:23:24,287 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:24,295 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:23:24,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:23:24,334 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:24,334 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:24,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:24,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:24,335 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:24,335 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:24,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:24,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2019-10-22 11:23:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:23:24,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:24,360 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:24,362 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1721357046, now seen corresponding path program 1 times [2019-10-22 11:23:24,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:24,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130457476] [2019-10-22 11:23:24,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:24,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:24,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:24,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130457476] [2019-10-22 11:23:24,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:24,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:24,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407150402] [2019-10-22 11:23:24,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:24,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:24,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:24,705 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 2 states. [2019-10-22 11:23:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:24,737 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2019-10-22 11:23:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:24,739 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2019-10-22 11:23:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:24,750 INFO L225 Difference]: With dead ends: 221 [2019-10-22 11:23:24,751 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 11:23:24,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 11:23:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-22 11:23:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 11:23:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2019-10-22 11:23:24,802 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 34 [2019-10-22 11:23:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:24,803 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2019-10-22 11:23:24,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2019-10-22 11:23:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:23:24,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:24,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:24,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash -122239248, now seen corresponding path program 1 times [2019-10-22 11:23:24,809 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:24,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559101548] [2019-10-22 11:23:24,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:24,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:24,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559101548] [2019-10-22 11:23:24,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:24,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:24,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180306539] [2019-10-22 11:23:24,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:24,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:24,984 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand 3 states. [2019-10-22 11:23:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:25,090 INFO L93 Difference]: Finished difference Result 327 states and 519 transitions. [2019-10-22 11:23:25,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:25,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:23:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:25,094 INFO L225 Difference]: With dead ends: 327 [2019-10-22 11:23:25,094 INFO L226 Difference]: Without dead ends: 220 [2019-10-22 11:23:25,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-22 11:23:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 117. [2019-10-22 11:23:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 11:23:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2019-10-22 11:23:25,125 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 35 [2019-10-22 11:23:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:25,125 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-10-22 11:23:25,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2019-10-22 11:23:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:23:25,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:25,127 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:25,127 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2107249571, now seen corresponding path program 1 times [2019-10-22 11:23:25,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:25,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811752564] [2019-10-22 11:23:25,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:25,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:25,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:25,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811752564] [2019-10-22 11:23:25,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:25,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:25,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815807529] [2019-10-22 11:23:25,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:25,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:25,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:25,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:25,247 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand 3 states. [2019-10-22 11:23:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:25,284 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2019-10-22 11:23:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:25,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:23:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:25,286 INFO L225 Difference]: With dead ends: 220 [2019-10-22 11:23:25,286 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 11:23:25,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 11:23:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-10-22 11:23:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 11:23:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2019-10-22 11:23:25,298 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 36 [2019-10-22 11:23:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:25,298 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2019-10-22 11:23:25,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2019-10-22 11:23:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 11:23:25,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:25,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:25,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1032935230, now seen corresponding path program 1 times [2019-10-22 11:23:25,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:25,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474399672] [2019-10-22 11:23:25,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:25,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:25,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474399672] [2019-10-22 11:23:25,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:25,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:25,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915092573] [2019-10-22 11:23:25,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:25,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:25,425 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2019-10-22 11:23:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:25,462 INFO L93 Difference]: Finished difference Result 191 states and 289 transitions. [2019-10-22 11:23:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:25,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-22 11:23:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:25,464 INFO L225 Difference]: With dead ends: 191 [2019-10-22 11:23:25,465 INFO L226 Difference]: Without dead ends: 120 [2019-10-22 11:23:25,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-22 11:23:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-10-22 11:23:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-22 11:23:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 182 transitions. [2019-10-22 11:23:25,475 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 182 transitions. Word has length 38 [2019-10-22 11:23:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:25,476 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 182 transitions. [2019-10-22 11:23:25,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2019-10-22 11:23:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:23:25,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:25,478 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:25,478 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1719269101, now seen corresponding path program 1 times [2019-10-22 11:23:25,479 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:25,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969984707] [2019-10-22 11:23:25,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:25,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:25,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:25,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969984707] [2019-10-22 11:23:25,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:25,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:23:25,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378714617] [2019-10-22 11:23:25,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:23:25,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:23:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:25,671 INFO L87 Difference]: Start difference. First operand 119 states and 182 transitions. Second operand 10 states. [2019-10-22 11:23:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:26,585 INFO L93 Difference]: Finished difference Result 562 states and 790 transitions. [2019-10-22 11:23:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:23:26,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-10-22 11:23:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:26,588 INFO L225 Difference]: With dead ends: 562 [2019-10-22 11:23:26,588 INFO L226 Difference]: Without dead ends: 513 [2019-10-22 11:23:26,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-10-22 11:23:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-22 11:23:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 153. [2019-10-22 11:23:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-22 11:23:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 229 transitions. [2019-10-22 11:23:26,626 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 229 transitions. Word has length 43 [2019-10-22 11:23:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:26,627 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 229 transitions. [2019-10-22 11:23:26,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:23:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 229 transitions. [2019-10-22 11:23:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:23:26,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:26,628 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:26,629 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:26,629 INFO L82 PathProgramCache]: Analyzing trace with hash 943468756, now seen corresponding path program 1 times [2019-10-22 11:23:26,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:26,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751439353] [2019-10-22 11:23:26,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:26,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:26,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:26,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751439353] [2019-10-22 11:23:26,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:26,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:26,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378880276] [2019-10-22 11:23:26,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:26,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:26,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:26,738 INFO L87 Difference]: Start difference. First operand 153 states and 229 transitions. Second operand 6 states. [2019-10-22 11:23:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:26,825 INFO L93 Difference]: Finished difference Result 285 states and 410 transitions. [2019-10-22 11:23:26,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:26,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-22 11:23:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:26,827 INFO L225 Difference]: With dead ends: 285 [2019-10-22 11:23:26,827 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 11:23:26,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 11:23:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 149. [2019-10-22 11:23:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-22 11:23:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2019-10-22 11:23:26,851 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 44 [2019-10-22 11:23:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:26,851 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2019-10-22 11:23:26,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2019-10-22 11:23:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:23:26,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:26,853 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:26,853 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:26,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1174671319, now seen corresponding path program 1 times [2019-10-22 11:23:26,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:26,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676460446] [2019-10-22 11:23:26,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:26,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:26,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:26,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676460446] [2019-10-22 11:23:26,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:26,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:26,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161055778] [2019-10-22 11:23:26,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:26,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:26,959 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand 5 states. [2019-10-22 11:23:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:27,067 INFO L93 Difference]: Finished difference Result 433 states and 638 transitions. [2019-10-22 11:23:27,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:23:27,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 11:23:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:27,069 INFO L225 Difference]: With dead ends: 433 [2019-10-22 11:23:27,069 INFO L226 Difference]: Without dead ends: 351 [2019-10-22 11:23:27,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-22 11:23:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 271. [2019-10-22 11:23:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-22 11:23:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2019-10-22 11:23:27,092 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 44 [2019-10-22 11:23:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:27,093 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2019-10-22 11:23:27,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2019-10-22 11:23:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:23:27,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:27,096 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:27,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1596126344, now seen corresponding path program 1 times [2019-10-22 11:23:27,097 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:27,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342580489] [2019-10-22 11:23:27,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:27,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:27,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:27,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342580489] [2019-10-22 11:23:27,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:27,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:23:27,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157723594] [2019-10-22 11:23:27,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:23:27,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:23:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:27,184 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 9 states. [2019-10-22 11:23:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:27,681 INFO L93 Difference]: Finished difference Result 800 states and 1135 transitions. [2019-10-22 11:23:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 11:23:27,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-10-22 11:23:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:27,685 INFO L225 Difference]: With dead ends: 800 [2019-10-22 11:23:27,685 INFO L226 Difference]: Without dead ends: 642 [2019-10-22 11:23:27,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2019-10-22 11:23:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-22 11:23:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 350. [2019-10-22 11:23:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-22 11:23:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 521 transitions. [2019-10-22 11:23:27,729 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 521 transitions. Word has length 45 [2019-10-22 11:23:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:27,729 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 521 transitions. [2019-10-22 11:23:27,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:23:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 521 transitions. [2019-10-22 11:23:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:23:27,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:27,730 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:27,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -792285918, now seen corresponding path program 1 times [2019-10-22 11:23:27,731 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:27,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667940577] [2019-10-22 11:23:27,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:27,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:27,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667940577] [2019-10-22 11:23:27,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:27,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:27,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275352547] [2019-10-22 11:23:27,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:27,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:27,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:27,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:27,788 INFO L87 Difference]: Start difference. First operand 350 states and 521 transitions. Second operand 4 states. [2019-10-22 11:23:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:27,839 INFO L93 Difference]: Finished difference Result 441 states and 637 transitions. [2019-10-22 11:23:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:27,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-22 11:23:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:27,843 INFO L225 Difference]: With dead ends: 441 [2019-10-22 11:23:27,843 INFO L226 Difference]: Without dead ends: 257 [2019-10-22 11:23:27,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-22 11:23:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 222. [2019-10-22 11:23:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-10-22 11:23:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 330 transitions. [2019-10-22 11:23:27,867 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 330 transitions. Word has length 46 [2019-10-22 11:23:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:27,867 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 330 transitions. [2019-10-22 11:23:27,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 330 transitions. [2019-10-22 11:23:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 11:23:27,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:27,872 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:27,872 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1597021696, now seen corresponding path program 1 times [2019-10-22 11:23:27,873 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:27,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994758103] [2019-10-22 11:23:27,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:27,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:27,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:27,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994758103] [2019-10-22 11:23:27,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:27,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:27,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860439672] [2019-10-22 11:23:27,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:27,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:27,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:27,936 INFO L87 Difference]: Start difference. First operand 222 states and 330 transitions. Second operand 3 states. [2019-10-22 11:23:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:27,981 INFO L93 Difference]: Finished difference Result 626 states and 942 transitions. [2019-10-22 11:23:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:27,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-22 11:23:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:27,983 INFO L225 Difference]: With dead ends: 626 [2019-10-22 11:23:27,983 INFO L226 Difference]: Without dead ends: 423 [2019-10-22 11:23:27,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-10-22 11:23:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 278. [2019-10-22 11:23:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-22 11:23:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 434 transitions. [2019-10-22 11:23:28,009 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 434 transitions. Word has length 52 [2019-10-22 11:23:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:28,009 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 434 transitions. [2019-10-22 11:23:28,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 434 transitions. [2019-10-22 11:23:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:23:28,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:28,010 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:28,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash -186933284, now seen corresponding path program 1 times [2019-10-22 11:23:28,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:28,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216173459] [2019-10-22 11:23:28,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:28,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216173459] [2019-10-22 11:23:28,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:28,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:28,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366351434] [2019-10-22 11:23:28,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:28,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,057 INFO L87 Difference]: Start difference. First operand 278 states and 434 transitions. Second operand 3 states. [2019-10-22 11:23:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:28,106 INFO L93 Difference]: Finished difference Result 792 states and 1250 transitions. [2019-10-22 11:23:28,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:28,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-22 11:23:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:28,110 INFO L225 Difference]: With dead ends: 792 [2019-10-22 11:23:28,110 INFO L226 Difference]: Without dead ends: 533 [2019-10-22 11:23:28,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-22 11:23:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 388. [2019-10-22 11:23:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-22 11:23:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 636 transitions. [2019-10-22 11:23:28,141 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 636 transitions. Word has length 53 [2019-10-22 11:23:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:28,142 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 636 transitions. [2019-10-22 11:23:28,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 636 transitions. [2019-10-22 11:23:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:23:28,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:28,143 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:28,144 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1955314594, now seen corresponding path program 1 times [2019-10-22 11:23:28,144 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:28,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442465393] [2019-10-22 11:23:28,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:28,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442465393] [2019-10-22 11:23:28,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:28,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:28,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198882887] [2019-10-22 11:23:28,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:28,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,203 INFO L87 Difference]: Start difference. First operand 388 states and 636 transitions. Second operand 3 states. [2019-10-22 11:23:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:28,279 INFO L93 Difference]: Finished difference Result 1118 states and 1848 transitions. [2019-10-22 11:23:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:28,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:23:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:28,283 INFO L225 Difference]: With dead ends: 1118 [2019-10-22 11:23:28,284 INFO L226 Difference]: Without dead ends: 749 [2019-10-22 11:23:28,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-10-22 11:23:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 604. [2019-10-22 11:23:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-22 11:23:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1028 transitions. [2019-10-22 11:23:28,336 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1028 transitions. Word has length 54 [2019-10-22 11:23:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:28,337 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1028 transitions. [2019-10-22 11:23:28,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1028 transitions. [2019-10-22 11:23:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:23:28,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:28,339 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:28,340 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1992051330, now seen corresponding path program 1 times [2019-10-22 11:23:28,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:28,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543007684] [2019-10-22 11:23:28,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:28,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543007684] [2019-10-22 11:23:28,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:28,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:28,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799113503] [2019-10-22 11:23:28,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:28,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,399 INFO L87 Difference]: Start difference. First operand 604 states and 1028 transitions. Second operand 3 states. [2019-10-22 11:23:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:28,534 INFO L93 Difference]: Finished difference Result 1758 states and 3008 transitions. [2019-10-22 11:23:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:28,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-22 11:23:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:28,539 INFO L225 Difference]: With dead ends: 1758 [2019-10-22 11:23:28,539 INFO L226 Difference]: Without dead ends: 1173 [2019-10-22 11:23:28,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-10-22 11:23:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1028. [2019-10-22 11:23:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-10-22 11:23:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1788 transitions. [2019-10-22 11:23:28,609 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1788 transitions. Word has length 55 [2019-10-22 11:23:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:28,609 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1788 transitions. [2019-10-22 11:23:28,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1788 transitions. [2019-10-22 11:23:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:23:28,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:28,611 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:28,611 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1363693892, now seen corresponding path program 1 times [2019-10-22 11:23:28,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:28,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879632105] [2019-10-22 11:23:28,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:28,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879632105] [2019-10-22 11:23:28,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:28,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:28,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891073766] [2019-10-22 11:23:28,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:28,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,663 INFO L87 Difference]: Start difference. First operand 1028 states and 1788 transitions. Second operand 3 states. [2019-10-22 11:23:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:28,777 INFO L93 Difference]: Finished difference Result 3014 states and 5256 transitions. [2019-10-22 11:23:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:28,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:23:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:28,786 INFO L225 Difference]: With dead ends: 3014 [2019-10-22 11:23:28,786 INFO L226 Difference]: Without dead ends: 2005 [2019-10-22 11:23:28,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-10-22 11:23:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1860. [2019-10-22 11:23:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-10-22 11:23:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3260 transitions. [2019-10-22 11:23:28,896 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3260 transitions. Word has length 56 [2019-10-22 11:23:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:28,896 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 3260 transitions. [2019-10-22 11:23:28,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3260 transitions. [2019-10-22 11:23:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 11:23:28,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:28,902 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:23:28,902 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:28,902 INFO L82 PathProgramCache]: Analyzing trace with hash 161239840, now seen corresponding path program 1 times [2019-10-22 11:23:28,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:28,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773265903] [2019-10-22 11:23:28,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:28,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:28,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773265903] [2019-10-22 11:23:28,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:28,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:28,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943652689] [2019-10-22 11:23:28,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:28,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:28,965 INFO L87 Difference]: Start difference. First operand 1860 states and 3260 transitions. Second operand 4 states. [2019-10-22 11:23:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:29,078 INFO L93 Difference]: Finished difference Result 1891 states and 3302 transitions. [2019-10-22 11:23:29,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:29,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-22 11:23:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:29,079 INFO L225 Difference]: With dead ends: 1891 [2019-10-22 11:23:29,079 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:23:29,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:23:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:23:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:23:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:23:29,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-10-22 11:23:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:29,082 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:23:29,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:23:29,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:23:29,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:23:29,703 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2019-10-22 11:23:29,924 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2019-10-22 11:23:30,118 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-10-22 11:23:30,559 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 154 [2019-10-22 11:23:31,071 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 152 [2019-10-22 11:23:31,470 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-10-22 11:23:31,664 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-10-22 11:23:31,804 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2019-10-22 11:23:32,046 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-10-22 11:23:32,459 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-10-22 11:23:32,689 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 20 [2019-10-22 11:23:32,957 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-10-22 11:23:33,079 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-10-22 11:23:33,304 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-10-22 11:23:33,746 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2019-10-22 11:23:33,928 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 30 [2019-10-22 11:23:34,169 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 24 [2019-10-22 11:23:34,488 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-10-22 11:23:35,091 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 16 [2019-10-22 11:23:35,292 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 28 [2019-10-22 11:23:35,451 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-10-22 11:23:36,035 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 16 [2019-10-22 11:23:36,199 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-10-22 11:23:36,382 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-10-22 11:23:36,522 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 19 [2019-10-22 11:23:36,756 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-10-22 11:23:37,086 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-10-22 11:23:37,349 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-10-22 11:23:37,702 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 32 [2019-10-22 11:23:37,884 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 16 [2019-10-22 11:23:38,301 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2019-10-22 11:23:38,638 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-10-22 11:23:38,640 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-10-22 11:23:38,640 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 337) no Hoare annotation was computed. [2019-10-22 11:23:38,641 INFO L439 ceAbstractionStarter]: At program point L366-1(lines 241 384) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,641 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 537) no Hoare annotation was computed. [2019-10-22 11:23:38,641 INFO L439 ceAbstractionStarter]: At program point L533-2(lines 526 541) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,641 INFO L443 ceAbstractionStarter]: For program point L533-3(lines 533 537) no Hoare annotation was computed. [2019-10-22 11:23:38,641 INFO L439 ceAbstractionStarter]: At program point L533-5(lines 526 541) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse4 .cse5 .cse6) (and .cse2 .cse1 (= 2 ULTIMATE.start_incoming_~client) .cse0 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6))) [2019-10-22 11:23:38,641 INFO L443 ceAbstractionStarter]: For program point L533-6(lines 533 537) no Hoare annotation was computed. [2019-10-22 11:23:38,641 INFO L439 ceAbstractionStarter]: At program point L533-8(lines 526 541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,642 INFO L439 ceAbstractionStarter]: At program point L303(lines 293 379) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,642 INFO L439 ceAbstractionStarter]: At program point L270(lines 260 382) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L2186(lines 2186 2197) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L446 ceAbstractionStarter]: At program point L171-1(lines 171 178) the Hoare annotation is: true [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L2186-1(lines 2186 2197) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L2253(lines 2253 2265) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L2253-2(lines 2253 2265) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L2253-4(lines 2253 2265) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 448) no Hoare annotation was computed. [2019-10-22 11:23:38,642 INFO L443 ceAbstractionStarter]: For program point L437-1(lines 437 448) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L439 ceAbstractionStarter]: At program point L339(lines 329 376) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point L2256(lines 2256 2264) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point L2256-2(lines 2256 2264) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point L2190(lines 2190 2196) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point L2256-4(lines 2256 2264) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point L2190-1(lines 2190 2196) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2019-10-22 11:23:38,643 INFO L439 ceAbstractionStarter]: At program point L2389(lines 2384 2392) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-10-22 11:23:38,644 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2019-10-22 11:23:38,648 INFO L443 ceAbstractionStarter]: For program point L242(lines 241 384) no Hoare annotation was computed. [2019-10-22 11:23:38,648 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-10-22 11:23:38,648 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 447) no Hoare annotation was computed. [2019-10-22 11:23:38,648 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 474 485) no Hoare annotation was computed. [2019-10-22 11:23:38,649 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 441 447) no Hoare annotation was computed. [2019-10-22 11:23:38,649 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 247) no Hoare annotation was computed. [2019-10-22 11:23:38,649 INFO L443 ceAbstractionStarter]: For program point L2259(lines 2259 2263) no Hoare annotation was computed. [2019-10-22 11:23:38,649 INFO L443 ceAbstractionStarter]: For program point L2259-3(lines 2259 2263) no Hoare annotation was computed. [2019-10-22 11:23:38,649 INFO L439 ceAbstractionStarter]: At program point L2259-2(lines 1 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:23:38,649 INFO L439 ceAbstractionStarter]: At program point L2259-5(lines 1 2539) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,649 INFO L443 ceAbstractionStarter]: For program point L2259-6(lines 2259 2263) no Hoare annotation was computed. [2019-10-22 11:23:38,649 INFO L439 ceAbstractionStarter]: At program point L2259-8(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,649 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-10-22 11:23:38,650 INFO L446 ceAbstractionStarter]: At program point L179(lines 161 181) the Hoare annotation is: true [2019-10-22 11:23:38,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2019-10-22 11:23:38,650 INFO L439 ceAbstractionStarter]: At program point L2195-1(lines 2178 2201) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (not (= ~rjh~0 1)) (= |ULTIMATE.start_getClientForwardReceiver_#res| 0) .cse1 (not (= 1 ULTIMATE.start_createEmail_~to)) .cse2) (and (= 2 ULTIMATE.start_createEmail_~to) (and .cse0 .cse1 .cse2) (= ~rjh~0 2)))) [2019-10-22 11:23:38,651 INFO L439 ceAbstractionStarter]: At program point L2195(lines 2178 2201) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 522) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 511 522) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 522) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 478 484) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L511-3(lines 511 522) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L2229-1(lines 2229 2245) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 2245) no Hoare annotation was computed. [2019-10-22 11:23:38,652 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 123) no Hoare annotation was computed. [2019-10-22 11:23:38,653 INFO L439 ceAbstractionStarter]: At program point L446(lines 433 451) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse4 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8)) (and .cse0 .cse1 (and .cse4 .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 .cse7 .cse8)))) [2019-10-22 11:23:38,653 INFO L446 ceAbstractionStarter]: At program point L446-1(lines 433 451) the Hoare annotation is: true [2019-10-22 11:23:38,653 INFO L439 ceAbstractionStarter]: At program point L281(lines 271 381) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,653 INFO L439 ceAbstractionStarter]: At program point L2528(lines 1 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:23:38,653 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 383) no Hoare annotation was computed. [2019-10-22 11:23:38,653 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 521) no Hoare annotation was computed. [2019-10-22 11:23:38,653 INFO L443 ceAbstractionStarter]: For program point L515-1(lines 515 521) no Hoare annotation was computed. [2019-10-22 11:23:38,653 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 521) no Hoare annotation was computed. [2019-10-22 11:23:38,653 INFO L443 ceAbstractionStarter]: For program point L515-3(lines 515 521) no Hoare annotation was computed. [2019-10-22 11:23:38,654 INFO L439 ceAbstractionStarter]: At program point L2398(lines 2393 2401) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-10-22 11:23:38,654 INFO L439 ceAbstractionStarter]: At program point L350(lines 340 375) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:23:38,654 INFO L439 ceAbstractionStarter]: At program point L317(lines 304 378) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,654 INFO L443 ceAbstractionStarter]: For program point L2233-1(lines 2233 2244) no Hoare annotation was computed. [2019-10-22 11:23:38,654 INFO L443 ceAbstractionStarter]: For program point L2233(lines 2233 2244) no Hoare annotation was computed. [2019-10-22 11:23:38,654 INFO L439 ceAbstractionStarter]: At program point L483(lines 470 488) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse4 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8)) (and .cse0 .cse1 (and .cse4 .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 .cse7 .cse8)))) [2019-10-22 11:23:38,654 INFO L446 ceAbstractionStarter]: At program point L483-1(lines 470 488) the Hoare annotation is: true [2019-10-22 11:23:38,655 INFO L439 ceAbstractionStarter]: At program point L385(lines 240 386) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,655 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 290) no Hoare annotation was computed. [2019-10-22 11:23:38,655 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 257) no Hoare annotation was computed. [2019-10-22 11:23:38,655 INFO L439 ceAbstractionStarter]: At program point L2335-1(lines 1 2539) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-10-22 11:23:38,655 INFO L443 ceAbstractionStarter]: For program point L2335(lines 2335 2342) no Hoare annotation was computed. [2019-10-22 11:23:38,655 INFO L443 ceAbstractionStarter]: For program point L2335-2(lines 2335 2342) no Hoare annotation was computed. [2019-10-22 11:23:38,655 INFO L439 ceAbstractionStarter]: At program point L2501(lines 2490 2504) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,655 INFO L443 ceAbstractionStarter]: For program point L2237-1(lines 2237 2243) no Hoare annotation was computed. [2019-10-22 11:23:38,655 INFO L443 ceAbstractionStarter]: For program point L2237(lines 2237 2243) no Hoare annotation was computed. [2019-10-22 11:23:38,656 INFO L439 ceAbstractionStarter]: At program point L520(lines 507 525) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,657 INFO L439 ceAbstractionStarter]: At program point L520-1(lines 507 525) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 1 ULTIMATE.start_setEmailTo_~handle))))) [2019-10-22 11:23:38,657 INFO L439 ceAbstractionStarter]: At program point L520-2(lines 507 525) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,657 INFO L446 ceAbstractionStarter]: At program point L520-3(lines 507 525) the Hoare annotation is: true [2019-10-22 11:23:38,657 INFO L446 ceAbstractionStarter]: At program point L2469-1(lines 2444 2471) the Hoare annotation is: true [2019-10-22 11:23:38,657 INFO L439 ceAbstractionStarter]: At program point L2469(lines 2444 2471) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 1 ULTIMATE.start_setEmailTo_~handle))))) [2019-10-22 11:23:38,657 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. [2019-10-22 11:23:38,657 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2019-10-22 11:23:38,658 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:23:38,658 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1187) no Hoare annotation was computed. [2019-10-22 11:23:38,658 INFO L443 ceAbstractionStarter]: For program point L1181-2(lines 1181 1187) no Hoare annotation was computed. [2019-10-22 11:23:38,658 INFO L439 ceAbstractionStarter]: At program point L2536(lines 2531 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:23:38,658 INFO L443 ceAbstractionStarter]: For program point L2206(lines 2206 2218) no Hoare annotation was computed. [2019-10-22 11:23:38,658 INFO L439 ceAbstractionStarter]: At program point L158(lines 138 160) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,658 INFO L439 ceAbstractionStarter]: At program point L292(lines 282 380) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,658 INFO L439 ceAbstractionStarter]: At program point L259(lines 249 383) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,658 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:23:38,658 INFO L439 ceAbstractionStarter]: At program point L2407(lines 2402 2410) the Hoare annotation is: (let ((.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= ~rjh~0 2)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle))) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse3 (and .cse0 .cse1 .cse2) .cse5) .cse4))) [2019-10-22 11:23:38,659 INFO L439 ceAbstractionStarter]: At program point L2242(lines 2225 2248) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,659 INFO L443 ceAbstractionStarter]: For program point L2209(lines 2209 2217) no Hoare annotation was computed. [2019-10-22 11:23:38,659 INFO L439 ceAbstractionStarter]: At program point L2242-1(lines 2225 2248) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2) .cse3) (and (and (and .cse1 .cse0 .cse2) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1)))) [2019-10-22 11:23:38,659 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 501) no Hoare annotation was computed. [2019-10-22 11:23:38,659 INFO L443 ceAbstractionStarter]: For program point L493-2(lines 493 501) no Hoare annotation was computed. [2019-10-22 11:23:38,659 INFO L439 ceAbstractionStarter]: At program point L361(lines 351 374) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,659 INFO L443 ceAbstractionStarter]: For program point L493-4(lines 493 501) no Hoare annotation was computed. [2019-10-22 11:23:38,659 INFO L439 ceAbstractionStarter]: At program point L328(lines 318 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,659 INFO L443 ceAbstractionStarter]: For program point L2212(lines 2212 2216) no Hoare annotation was computed. [2019-10-22 11:23:38,660 INFO L443 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-10-22 11:23:38,660 INFO L443 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2019-10-22 11:23:38,661 INFO L439 ceAbstractionStarter]: At program point L2212-2(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:38,661 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:23:38,661 INFO L439 ceAbstractionStarter]: At program point L2477-1(lines 2472 2480) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (= ~__ste_email_to0~0 2) .cse3 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6 .cse7)) (and .cse0 .cse1 (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= 1 ULTIMATE.start_setEmailTo_~handle))))) [2019-10-22 11:23:38,661 INFO L439 ceAbstractionStarter]: At program point L2477(lines 2472 2480) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse3 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5 .cse6 .cse7)) (and .cse0 (and .cse3 .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse1 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5 .cse6 .cse7)))) [2019-10-22 11:23:38,661 INFO L446 ceAbstractionStarter]: At program point L2477-3(lines 2472 2480) the Hoare annotation is: true [2019-10-22 11:23:38,661 INFO L439 ceAbstractionStarter]: At program point L2477-2(lines 2472 2480) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_isReadable_#res| 1) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,661 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2019-10-22 11:23:38,662 INFO L439 ceAbstractionStarter]: At program point L2312(lines 1 2539) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,662 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-10-22 11:23:38,662 INFO L439 ceAbstractionStarter]: At program point L198(lines 1173 1190) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse1 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse4 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse6 .cse7 .cse8)) (and .cse0 .cse1 (and .cse4 .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse2 (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 .cse7 .cse8)))) [2019-10-22 11:23:38,662 INFO L439 ceAbstractionStarter]: At program point L2312-1(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,662 INFO L446 ceAbstractionStarter]: At program point L198-1(lines 1173 1190) the Hoare annotation is: true [2019-10-22 11:23:38,662 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2019-10-22 11:23:38,662 INFO L439 ceAbstractionStarter]: At program point L496-2(lines 489 504) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,662 INFO L443 ceAbstractionStarter]: For program point L496-3(lines 496 500) no Hoare annotation was computed. [2019-10-22 11:23:38,662 INFO L439 ceAbstractionStarter]: At program point L496-5(lines 489 504) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:38,663 INFO L443 ceAbstractionStarter]: For program point L496-6(lines 496 500) no Hoare annotation was computed. [2019-10-22 11:23:38,663 INFO L439 ceAbstractionStarter]: At program point L496-8(lines 489 504) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (and (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1))) (.cse2 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2) .cse3) (and (and (and .cse1 .cse0 .cse2) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (= |ULTIMATE.start_isReadable_#res| 1)))) [2019-10-22 11:23:38,663 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 538) no Hoare annotation was computed. [2019-10-22 11:23:38,663 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 538) no Hoare annotation was computed. [2019-10-22 11:23:38,663 INFO L443 ceAbstractionStarter]: For program point L530-4(lines 530 538) no Hoare annotation was computed. [2019-10-22 11:23:38,663 INFO L443 ceAbstractionStarter]: For program point L2182(lines 2182 2198) no Hoare annotation was computed. [2019-10-22 11:23:38,663 INFO L443 ceAbstractionStarter]: For program point L2182-1(lines 2182 2198) no Hoare annotation was computed. [2019-10-22 11:23:38,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:38 BoogieIcfgContainer [2019-10-22 11:23:38,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:38,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:38,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:38,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:38,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:24" (3/4) ... [2019-10-22 11:23:38,707 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:23:38,739 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2019-10-22 11:23:38,741 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-10-22 11:23:38,742 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 11:23:38,743 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:23:38,787 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,788 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,790 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,790 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,790 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && 2 == client) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-10-22 11:23:38,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:38,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-10-22 11:23:38,792 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-10-22 11:23:38,792 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 1 && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (\result == 1 && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:38,793 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) [2019-10-22 11:23:38,793 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:38,794 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) [2019-10-22 11:23:38,794 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:38,794 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) [2019-10-22 11:23:38,794 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:38,795 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,795 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) [2019-10-22 11:23:38,795 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,795 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == 3 && !(rjh == 1)) && \result == 0) && \result == 1) && !(1 == to)) && 1 == msg) || ((2 == to && (handle == 3 && \result == 1) && 1 == msg) && rjh == 2) [2019-10-22 11:23:38,796 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) [2019-10-22 11:23:38,796 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) [2019-10-22 11:23:38,796 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,796 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:38,928 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_da9cfab6-6b13-4a6a-8049-4fe931fea733/bin/utaipan/witness.graphml [2019-10-22 11:23:38,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:38,929 INFO L168 Benchmark]: Toolchain (without parser) took 16927.78 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 571.5 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -270.1 MB). Peak memory consumption was 301.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:38,929 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:38,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 923.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:38,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:38,930 INFO L168 Benchmark]: Boogie Preprocessor took 83.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:38,930 INFO L168 Benchmark]: RCFGBuilder took 1158.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 110.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:38,930 INFO L168 Benchmark]: TraceAbstraction took 14432.61 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 466.6 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -286.7 MB). Peak memory consumption was 498.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:38,931 INFO L168 Benchmark]: Witness Printer took 225.46 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:38,933 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 923.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1158.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 110.0 MB). Peak memory consumption was 110.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14432.61 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 466.6 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -286.7 MB). Peak memory consumption was 498.3 MB. Max. memory is 11.5 GB. * Witness Printer took 225.46 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 197]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 197]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2490]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2444]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2225]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2225]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: (((((((((((1 == handle && handle == 3) && 2 == client) && 1 == handle) && value == 2) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: (((((handle == 3 && !(rjh == 1)) && \result == 0) && \result == 1) && !(1 == to)) && 1 == msg) || ((2 == to && (handle == 3 && \result == 1) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2402]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && handle == 3) && 2 == \result) && 2 == client) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2444]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: (\result == 1 && ((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || (\result == 1 && (((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: ((((handle == 3 && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && 2 == handle) && 2 == client) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2384]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && 2 == handle) && handle == 3 && \result == 1) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) || ((((((2 == to && handle == 3 && \result == 1) && rjh == 2) && 1 == handle) && 1 == msg) && tmp == 1) && \result == 1) - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((__ste_client_forwardReceiver1 == 0 && rjh == handle) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((handle == 3 && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2393]: Loop Invariant Derived loop invariant: ((tmp == 1 && \result == 1) && (((((1 == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) && 1 == handle) || ((((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && 2 == to) && (1 == msg && handle == 3) && \result == 1) && rjh == 2) && 1 == msg) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && handle == 3) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 318]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((1 == msg && handle == 3) && 1 == handle) && \result == 1) && 1 == handle) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((1 == handle && handle == 3) && 2 == client) && 1 == msg) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 2 error locations. Result: SAFE, OverallTime: 14.3s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.5s, HoareTripleCheckerStatistics: 2997 SDtfs, 4251 SDslu, 5307 SDs, 0 SdLazy, 496 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1860occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 1644 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 54 PreInvPairs, 917 NumberOfFragments, 1479 HoareAnnotationTreeSize, 54 FomulaSimplifications, 8612669 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 54 FomulaSimplificationsInter, 908320 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 46893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...